Question: Apply the CDS (Campbell, Dudek, and Smith) Algorithm to obtain an efficient solution for the following 4-job 4-machine flow shop scheduling problem with an objective
Apply the CDS (Campbell, Dudek, and Smith) Algorithm to obtain an efficient solution for the following 4-job 4-machine flow shop scheduling problem with an objective of minimizing the makespan.
| Job (j) | p1j | p2j | p3j | p4j |
| 1 | 4 | 3 | 7 | 8 |
| 2 | 8 | 6 | 6 | 5 |
| 3 | 2 | 5 | 8 | 9 |
| 4 | 6 | 4 | 3 | 4 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
