This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 45 30 55 45 100 65 20 All jobs above must go through two machines in a fixed order: from M1 to M2 . Find the optimal sequence that minimizes completion time. Show your process and use a Gantt chart to determine the completion time. Problem 3 Job A (due date: 16) M3 M1 M2 Processing Time 5 3 5 Job B (due date: 19) M2 M3 M4 Processing Time 3 2 4 Job C (due date: 18) M1 M3 M4 Processing Time 3 4 6 Job D (due date: 21) M4 M2 M1 M2 Processing Time 4 2 5 3 Job E (due date: 21) M2 M1 M2 M3 Processing Time 3 2 2 5 a) Assume all the jobs arrive at time 0. Generate a schedule using a Gantt chart based on SPT, and determine maximum tardiness. Break ties with job index. b) Assume all the jobs arrive at time 0. Generate a schedule using a Gantt chart based on Critical Ratio, and determine maximum tardiness. Break ties with job index....
View Full Document
- Spring '11