Question: Problem 6 - 2 1 ( Algo ) Consider the following tasks, times, and predecessors for an assembly of set - top cable converter boxes:

Problem 6-21(Algo)
Consider the following tasks, times, and predecessors for an assembly of set-top cable converter boxes:
\table[[TASK ELEMENT,TIME (MINUTES),PRECEDING TASKS],[A,7,-],[B,7,A],[C,8,B],[D,7,B],[E,9,C, D],[F,7,A],[G,7,F],[H,8,G],[I,7,E, H]]
Given a cycle time of 22 minutes, develop two alternative layouts. Use the longest task time rule and the largest number of following tasks as a secondary criterion. What is the highest efficiency of your layout, assuming the 22-minute cycle time?
Note: Enter your answer as a percentage rounded to 2 decimal places.
 Problem 6-21(Algo) Consider the following tasks, times, and predecessors for an

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!