2. Process times for all jobs are one hour. Changeovers between families require

Question

2. Process times for all jobs are one hour. Changeovers between families require four hours. Thus, the completion time for job 1 is 5, for job 2 is 6, for job 3 is 11, and so on. Job Number Family CodeDue Date 6 12 13 15 19 20 4 6 25 27 10 a) How many possible sequences are there? b) Compute the total tardiness of the current sequence (i.e. 1 to 10). c) Is there any sequence with no tardiness? d) Here, the processing times are deterministic (one hour). Suppose you are dealing with uniformly distributed stochastic processing times (e.g. 45 t

Explanation / Answer

Job 1 2 3 4 5

Processing time 1 1 1 1 1

Due date 5 6 7 8 9

Flow time 1 2 8 9 10

Tardiness 0 0 1 1 1

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

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