In class we learned that SPT rule minimizes the average flow time, and EDD rule

Question

In class we learned that SPT rule minimizes the average flow time, and EDD rule minimizes maximum tardiness. There also exists a rule that minimizes the number of tardy jobs: an algorithm from Moore (1968). A machine shop processes custom orders from a variety of clients, one of the machines, a grinder, has six jobs (labeled A, B, C, D, E, F) remaining to be processed. The jobs are sequenced according to Moore's rule. The sequence (B-C-D-F-E-A), along with the processing times and due dates, are given in the table below. Fill the blanks below. Only enter numbers (e.g. do not type "3 jobs", just type in "3"). If you get a non-integer answer, round it up to 2 decimals.

Explanation / Answer

job Due date Processing time flow time tardiness B 6 3 6 0 C 9 4 15 6 D 23 8 38 15 F 30 6 68 38 E 20 10 88 68 A 15 10 103 88 Average 53.0 35.8 Average flow time = 53.0 Avg number of jobs = 2.512 103/sum of all process time avg. tradiness = 35.8 max. tardiness = 88 number of tardy jobs = 5

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.