1. Scheduling Operations IDS 605 Spring 1999

3. Data Collection for Scheduling l Jobs l Activities l Employees l Equipment l Facilities Transparency 18.1

4. Managerial Considerations l Meeting customer due date l Minimizing flow time l Minimizing WIP inventory l Minimizing costs l Minimizing idle time »equipment »employee Transparency 18.2

5. Shop Floor Control - Scheduling l Suppose we have a group of jobs waiting in front of a work center. How do we decide which job to run next (i.e., priority assignment)? l We will examine 4 common priority rules. l We will evaluate the performance of the rules via shop efficiency and customer service measurements.

7. First-Come First-Served (FCFS) Sequence

8. SPT (a.k.a. SON) Sequence

9. Earliest Due Date (EDD) Sequence

10. Critical Ratio (CR) Sequence

11. Summary

12. Jobs to be Processed on Two Machines Processing time (hours) Job Computing Printing A 1.5 1.0 B 1.0.75 C.5 1.25 D 2.0 1.5 E.75.5 Transparency 18.4

13. Processing of Computer Jobs Based on Sequencing by Johnson’s Rule Transparency 18.5(Exhibit 18.6)

14. Forward Schedule for Four Jobs with Finite Loading Transparency 18.6(Exhibit 18.7)

15. Backward Schedule for Jobs with Infinite Loading Transparency 18.7(Exhibit 18.8)

16. Gantt Load Chart for Forward Schedule Transparency 18.8(Exhibit 18.10)