Question: Pairwise Exchange Method - For the next iteration we consider all feasible exchanges 12,13,14,23,24,34 - Lets calculate TC for each of the possible movements of

Pairwise Exchange Method - For the next iteration
Pairwise Exchange Method - For the next iteration we consider all feasible exchanges 12,13,14,23,24,34 - Lets calculate TC for each of the possible movements of our new layout: TC3224=10(1)+15(2)+20(1)+10(1)+5(2)+5(3)=95 TC1324=10(2)+15(1)+20(3)+10(1)+5(1)+5(2)=120 TC4421=10(1)+15(3)+20(2)+10(2)+5(1)+5(1)=125 TC213c=10(1)+15(1)+20(2)+10(2)+5(3)+5(2)=105 TC3142=10(2)+15(1)+20(1)+10(3)+5(1)+5(2)=100 TC4123=10(1)+15(2)+20(1)+10(1)+5(2)+5(3)=95 - The lowest TC is greater that our lowest TC in previous iteration, the procedure is terminated. Layout arrangement selected is 2-3-1-4 Pairwise Exchange Method - For the next iteration we consider all feasible exchanges 12,13,14,23,24,34 - Lets calculate TC for each of the possible movements of our new layout: TC3224=10(1)+15(2)+20(1)+10(1)+5(2)+5(3)=95 TC1324=10(2)+15(1)+20(3)+10(1)+5(1)+5(2)=120 TC4421=10(1)+15(3)+20(2)+10(2)+5(1)+5(1)=125 TC213c=10(1)+15(1)+20(2)+10(2)+5(3)+5(2)=105 TC3142=10(2)+15(1)+20(1)+10(3)+5(1)+5(2)=100 TC4123=10(1)+15(2)+20(1)+10(1)+5(2)+5(3)=95 - The lowest TC is greater that our lowest TC in previous iteration, the procedure is terminated. Layout arrangement selected is 2-3-1-4

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!