Chapter $6,$ Problem $5$

What is the calculated cycle time?

$1\mathrm{.}2$

$2$

$3\mathrm{.}4$

$4\mathrm{.}6$

$5$ points

QUESTION $10$

Chapter $6,$ problem $5$

What is the theoretical minimum number of stations needed?

$3$

$5$ points

QUESTION $11$

Chapter $6,$ Problem $5$

Assign tasks to workstations on the basis of greatest number of following tasks. Use longest processing time as a tiebreaker. If ties still exist, assume indifference in choice. How many workstations do you need?

$2$

$3$

$4$

$5$

$5$ points

QUESTION $12$

Chapter $6,$ Problem $5$

Assign tasks to workstations on the basis of greatest number of following tasks. Use longest processing time as a tiebreaker. If ties still exist, assume indifference in choice. Which task$($s$)$ will be assigned to workstation $1?$

a$,$ b$,$ c$,$ d

a$,$ b$,$ c$,$ e

a$,$ b$,$ c$,$ f

d$,$ e$,$ f

$5$ points

QUESTION $13$

Chapter $6,$ Problem $5$

Assign tasks to workstations on the basis of greatest number of following tasks. Use longest processing time as a tiebreaker. If ties still exist, assume indifference in choice. What will be the percentage of idle time for this assignment? $($Please convert the result to decimal point format and keep $3$ digits after the decimal point.$)$