Consider the following jobs to be scheduled on a single machine. Assume that all jobs are...

  

Transcribed Image Text:

Consider the following jobs to be scheduled on a single machine. Assume that all jobs are available and the machine is idle at time 0. Jobs A B C D E Processing Time 2 3 1 6 4 Due Date 12 8 7 10 9 6 Tardiness Weight 4 2 2 3 1 a) What are the total weighted tardiness, total flow time and maximum tardiness of the schedule that is obtained using EDD rule? b) Start from schedule that you find in part a) and obtain a schedule such that total weighted tardiness is minimized using the greedy approach explained in class. c) Use the Apparent Urgency rule or R&M rule discussed in class to obtain a schedule. Use the rule dynamically to dispatch one job at a time. What is the resulting total tardiness? Assume k=2.0. Consider the following jobs to be scheduled on a single machine. Assume that all jobs are available and the machine is idle at time 0. Jobs A B C D E Processing Time 2 3 1 6 4 Due Date 12 8 7 10 9 6 Tardiness Weight 4 2 2 3 1 a) What are the total weighted tardiness, total flow time and maximum tardiness of the schedule that is obtained using EDD rule? b) Start from schedule that you find in part a) and obtain a schedule such that total weighted tardiness is minimized using the greedy approach explained in class. c) Use the Apparent Urgency rule or R&M rule discussed in class to obtain a schedule. Use the rule dynamically to dispatch one job at a time. What is the resulting total tardiness? Assume k=2.0.