Question: Three jobs are to be scheduled in a five-machine flow shop. Job data are summarized in the following table. Job 1 2 3 A
Three jobs are to be scheduled in a five-machine flow shop. Job data are summarized in the following table. Job 1 2 3 A 2.0 0.5 1.2 B 4.5 2.4 0.3 Machine C 1.0 0.2 0.5 D 3.2 0.1 1.4 E 4.1 2.8 8.2 a. For each machine, find a lower bound on makespan. b. Construct a Gantt chart for job processing sequence 1, 2, 3. c. Enumerating all possible orderings, find an optimal permutation schedule with the objective of minimizing makespan.
Step by Step Solution
There are 3 Steps involved in it
The image contains a table with processing times for three jobs across five machines labeled A through E The processing times are as follows Job 1 A 2... View full answer
Get step-by-step solutions from verified subject matter experts
