Question: Answer : ( c ) Precedence Network Diagram with forword and backword pass computation: - Es Acc Ef Ls Dur Lf 0 a 0 .
Answer :
c
Precedence Network Diagram with forword and backword pass computation:
Es Acc Ef
Ls Dur Lf
a
X
b
e
c
f
Critical Path : aefgiklmn
Porject durationCycle Time Minutse
a
Total Available Time per shift Hrs Min Hrs Min Hrs Min Min
The number of widgets that can be produced per shift with one workstation Total Available Time Cycle time Widgets
Hence, it is not possible to accomplish the objective of widgets per shift with one workstation.
b
Maximum possible output with workstation Widgets
d
Theoretical minimum number of workstations to achieve pieces per shift
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
