Question: Question 2 (40 pts): Job 1 2 3 4 Processing Time in Days 8 6 1 9 12 15 2 Due Date D(Day! 19 10

Question 2 (40 pts): Job 1 2 3 4 Processing Time
Question 2 (40 pts): Job 1 2 3 4 Processing Time
Question 2 (40 pts): Job 1 2 3 4 Processing Time
Question 2 (40 pts): Job 1 2 3 4 Processing Time
Question 2 (40 pts): Job 1 2 3 4 Processing Time in Days 8 6 1 9 12 15 2 Due Date D(Day! 19 10 s 22 30 50 6 la luna 6 7 For the data above, find the mean flowtime (aka average completion time), mean lateness, mean tardiness, and maximum tardiness. A. Using SPT: Shortest processing time B. Using EDD: Earliest due date C. Using CR. Critical Ratio CR-(Due date-Time now)/Processing time D. Using Moore's Algorithm to Minimize Number of Tardy Jobs E. Comment on the performance of the dispatching rules applied. Did any perform best in all criteria? Question 2 (40 pts): Job 1 2 3 4 5 Processing Time in Days 8 6 1 9 12 15 2. Due Date D (Day) 19 10 5 22 30 50 6 un 6 6 7 For the data above, find the mean flowtime (a.k.a. average completion time), mean lateness, mean tardiness, and maximum tardiness. A. Using SPT: Shortest processing time B. Using EDD: Earliest due date C. Using CR. Critical Ratio. CR-(Due date-Time now)/Processing time D. Using Moore's Algorithm to Minimize Number of Tardy Jobs E. Comment on the performance of the dispatching rules applied. Did any perform best in all criteria

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!