Use this scenario for the following question(s).
The process design team at a manufacturer has broken an assembly process into eight basic steps, each with a required time, and predecessor as shown in the table. There are 8 productive hours available in a day and the manufacturer wishes to produce 400 units. Use this information to answer the following question(s).
$$\begin{array} { | c | c | c | }
\hline \text { Task } & \text { Time } ( \mathrm { sec } ) & \text { Predecessor } \
\hline \mathrm { J } & 45 & \cdots \
\hline \text { K } & 50 & \mathrm {~J} \
\hline \mathrm { L } & 40 & \mathrm {~J} \
\hline \mathrm { M } & 55 & \mathrm {~K} , \mathrm {~L} \
\hline \mathrm { N } & 40 & \mathrm { M } \
\hline \mathrm { O } & 65 & \mathrm { M } \
\hline \text { P } & 25 & \mathrm {~N} \
\hline \text { R } & 35 & \mathrm { O } , \mathrm { P } \
\hline
\end{array}$$
-Refer to the scenario above. What is the theoretical minimum number of stations?
A)four
B)five
C)six
D)seven

Question

Use this scenario for the following question(s).
The process design team at a manufacturer has broken an assembly process into eight basic steps, each with a required time, and predecessor as shown in the table. There are 8 productive hours available in a day and the manufacturer wishes to produce 400 units. Use this information to answer the following question(s).
 $$\begin{array} { | c | c | c | } 
\hline \text { Task } & \text { Time } ( \mathrm { sec } ) & \text { Predecessor } \
\hline \mathrm { J } & 45 & \cdots \
\hline \text { K } & 50 & \mathrm {~J} \
\hline \mathrm { L } & 40 & \mathrm {~J} \
\hline \mathrm { M } & 55 & \mathrm {~K} , \mathrm {~L} \
\hline \mathrm { N } & 40 & \mathrm { M } \
\hline \mathrm { O } & 65 & \mathrm { M } \
\hline \text { P } & 25 & \mathrm {~N} \
\hline \text { R } & 35 & \mathrm { O } , \mathrm { P } \
\hline
\end{array}$$
-Refer to the scenario above. What is the theoretical minimum number of stations?
A)four
B)five
C)six
D)seven

Quizplus · Accepted Answer

The theoretical minimum number of stations can be found using the longest sequence of dependent tasks, which in this case is J-K-M-N-P-R. There are six tasks in this sequence, so the theoretical minimum number of stations is six. However, since task M has two predecessors (K and L), it would be more efficient to split task M into two parallel stations, which would bring the total number of stations to five.

Use This Scenario for the Following Question(s) -Refer to the Scenario Above