2. Chapter Eight Operations Scheduling

3. Hierarchy of Production Decisions Fig. 8-1

4. Typical Job Shop Layout Fig. 8-2

5. A Process Composed of TwoOperations in Series Fig. 8-3

6. Conflicting Objectives in Job Shop Management Fig. 8-4

7. Precedence Constraints for Example 8.4 Fig. 8-5

8. All Possible Schedules for Two Jobs on Two Machines Fig. 8-6

9. Gantt Chart for the Optimal Schedule for Example 8.5 Fig. 8-7

10. Graphical Solution of Example 8.7 Fig. 8-8

11. Gantt Chart for Optimal Solution to Example 8.7 Fig. 8-9

12. Graphical Solution ofExample 8.8 Fig. 8-10

13. Gantt Chart for Optimal Solution to Example 8.8 Fig. 8-11

14. Realization of Parallel Processing on Two Machines with Random Job Times Fig. 8-12

15. Relative Flow Times:SPT versus FCFS Fig. 8-13

16. Schematic of a Typical Assembly Line Fig. 8-14

17. Precedence Constraints for Noname Computer (Example 8.11) Fig. 8-15

18. (For Problem 27) Fig. 8-16

19. (For Problem 29) Fig. 8-17