題組內容

4. Solve the following two-machine flow-shop scheduling problem.
612dcd9f6745c.jpg

(1) Determine the optimum processing sequence for the jobs to minimize makespan and draw the Gantt chart. (15%)