Task time $($minutes$)$

A$,0\mathrm{.}1$

B$,0\mathrm{.}4$

C$,0\mathrm{.}3$

D$,1\mathrm{.}3$

E$,0\mathrm{.}1$

F$,0\mathrm{.}8$

G$,0\mathrm{.}3$

H$,1\mathrm{.}2$

$6.$ Cycle time $=1\mathrm{.}3$ minutes; the maximum time each workstation has is $1\mathrm{.}3$ minutes. Use the longest task time heuristic.

a$)$ Balance the line $($fill out the table below$)$ using the longest task time heuristic: If more than one task is eligible, choose the longest task if enough remaining time exists. For the first workstation, eligible tasks are A$,$ C$,$ and E$.$