Flow Shop Scheduling

Consider the following data:

Suppose we have a 3-machine flow shop and the processing times are given in the table above.

(a) Using Campbell-Dudek-Smith (CDS) method, determine a schedule for the flow shop that minimizes makespan.

(b) Calculate the value of the makespan from part (a).

\begin{tabular}{|l|l|l|l|} \hline Processing times & t1 & t2 & t3 \\ \hlinem1 & 3 & 6 & 12 \\ \hlinem2 & 7 & 13 & 7 \\ \hlinem3 & 15 & 6 & 9 \\ \hline \end{tabular}