Question: Question 2: (25 points) Consider the flow shop problem as follows: M1 M2 B2 Cap=1 M3 In this flow shop if the machine 3 is

Question 2: (25 points) Consider the flow shop

Question 2: (25 points) Consider the flow shop problem as follows: M1 M2 B2 Cap=1 M3 In this flow shop if the machine 3 is free the finished job at machine 2 can move directly to machine 3. If the machine 3 is busy, the finished job at machine 2 can move to buffer B2 and wait here. The capacity of buffer B2 is 1. The processing time of each job on each machine is given as follows = Job Sequence Pij: processing time on machine i of jobj 1 1,2,3 P11 = 8,P21 = 4, P31 = 4 2 1,2,3 P22 = 3,P 12 = 7, P32 = 5 3 1,2,3 P13 = 5,P33 = 9,P23 = 6 Find the optimal sequence for this flow shop problem. Write down the code = =

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!