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.

Consider a two machine job shop scheduling

Job Routing Information Processing Time B 5 A 1 2 5 4 1 2 3 4 5 6 7 8 9 10 B A A A B B A B A B A B B A 3 9 2 1 4 3 4 1 7 5

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!