Question: Consider a two machine job shop scheduling problem with 10 jobs to be processed on machines A and/or B. The routing information and processing times
Consider a two machine job shop scheduling problem with 10 jobs to be processed on machines A and/or B. The routing information and processing times of these jobs are given in the table below. Find the schedule that minimizes the makespan. Draw a Gantt chart for the optimum schedule and report the corresponding makespan value.

Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
