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

Consider a two machine job shop scheduling problem with 10 jobs to 

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. Job Routing Information 1 2 3 4 5 6 7 8 9 10 B A B B A A B BA A B B B A A A 2 5 2 6 1 2 - 5 4 Processing Time B 3 5 4 - 2 4 5 6 3

Step by Step Solution

3.37 Rating (150 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Answer To solve the twomachine job shop scheduling problem and minimize the makespan we can use a he... View full answer

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!