Question: Q5. Consider the following two identical machines problem. Job Process time Weights Due date 1 8 6 6 2 3 3 10 3 4 1

Q5. Consider the following two identical machines problem. Job Process time Weights Due date 1 8 6 6 2 3 3 10 3 4 1 11 4 6 4 12 5 5 8 13 6 7 5 14 Find the optimum sequence that minimize the total completion time. Then compute average tardiness, average completion time, maximum tardiness, number of tardy jobs, and average weighted tardiness
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
