Chapter $6,$ Problem $1$

What are the minimum and maximum cycle times?

$2\mathrm{.}4$ minutes, $18$ minutes

$18$ minutes, $450$ minutes

$2\mathrm{.}4$ minutes, $450$ minutes

$1$ minutes, $18$ minutes

if we want to achieve the maximum output rate of the process, what is the minimum number of workstations

needed?

What cycle time will provide an output rate of $125$ units per day?

$2\mathrm{.}4$ minutes

$3\mathrm{.}6$ minutes

$300$ minutes

$450$ minutes

A manager wants to assign tasks to workstations as efficiently as possible and achieve an hourly output of four units. The department uses a working time of $56$ minutes per hour. Assign the tasks shown in the accompanying precedence diagram $($times are in minutes$)$ to workstations in order of most following tasks, tiebreaker: greatest positional weight. Which task$($s$)$ will be assigned to workstation $2?$

Assign the tasks shown in the accompanying precedence diagram $($times are in minutes$)$ to workstations in order of greatest positional weight, tiebreaker: most following tasks. Which task$($s$)$ will be assigned to workstation $2?$

A manager wants to assign tasks to workstations as efficiently as possible and achieve an hourly output of four units. The department uses a working time of $56$ minutes per hour. Assign the tasks shown in the accompanying precedence diagram $($times are in minutes$)$ to workstations in order of most following tasks, tiebreaker: greatest positional weight. What is the efficiency? $($Please keep $4$ digits after the decimal point?$)$

What is the calculated cycle time?

$1\mathrm{.}2$

$2$

$3\mathrm{.}4$

$4\mathrm{.}6$

Chapter $6,$ problem $5$

What is the theoretical minimum number of stations needed?

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$

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

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.$)$

What is the calculated cycle time for this process?

Assign tasks according to the most following tasks rule. Break ties with the greatest positional weight rule. How many workstations do we need?