Question: Following is a 5 job 3 machine flow shop problem. If the Johnson's algorithm can be applicable to this problem, a) Find the optimal
Following is a 5 job 3 machine flow shop problem. If the Johnson's algorithm can be applicable to this problem, a) Find the optimal sequence and the corresponding makespan. b) Calculate the each machine's idle time. Job Processing time Machine2 9 8 6 12345 2 Machinel 12 22428 20 14 20 8 Machine3 11 12 129 16 20
Step by Step Solution
3.50 Rating (147 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
