Question: table [ [ Task , ( seconds ) , Predecessors ] , [ A , 2 0 , - ] , [ B ,

\table[[Task,(seconds),Predecessors],[A,20,-],[B,27,A],[C,15,A],[D,14,A],[E,10,B, C],[F,28,D, E]]
This exercise only contains parts b,c,d,e, and f.
b) Given the demand, the cycle time for the production of the new train set =31.3 seconds (round your response to one decimal place).
c) The theoretical minimum number of workstations =4(round your response up to the next whole number).
d) Using the longest operation time rule, the assignment of tasks to workstations should be: (Hint: Number workstations sequentially in terms of precedence relationships and combine any applicable tasks.)
\table[[Task,Workstation #],[A,Station 1],[B,Station 2],[C,Station 3],[D,Station 3],[E,Station 4],[F,Station 5]]
Were you able to assign all the tasks to the theoretical minimum number of workstations? No
e) The total idle time per cycle for the process =31 seconds (enter your response as a whole number).
f) The efficiency of the assembly line with 5 workstations =%(enter your response as a percentage rounded to one decimal place).
 \table[[Task,(seconds),Predecessors],[A,20,-],[B,27,A],[C,15,A],[D,14,A],[E,10,B, C],[F,28,D, E]] This exercise only contains parts b,c,d,e, and f.

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!