Cnapter $8.$ Assigmmemit

Balance the assembly line shown below for $($a$)$ a shift output of $50$ pieces and $($b$)$ a shift output of $30$ pleces. Assume an five$-$hour shift, and use the rule: choose the assignable task with the longest processing time. Compute the line efficiency for each case.

a$.$ Fill in the table below for a shift output of $50$ pieces. Break ties by choosing the lowest task number. If your answer is zero, enter $"0".$ Round your answers to the nearest whole number.

$\backslash$table$[[$Workstation$,$Tasks,Total Time$],[1,-$ Select$-,],[2,,],[3,,],[4,-$ Select$-0,]]$

Idle Time

What is the assembly$-$line efficiency? Round your answer to one decimal place.

What is the assembly$-$line efficiency? Round your answer to one decimal place.

$\%$

Fill in the table below for a shift output of $30$ pieces. Break ties by choosing the lowest task number. If your answer is zero, enter $"0".$ Round your answers to the nearest whole number.

$\backslash$table$[[$Workstation$,$Tasks,Total Time$],[1,,],[2,,],[3,-$Select$--,],[,$Total,$]]$

Idle Time

$$

What is the assembly$-$line efficiency? Round your answer to one decimal place.

$\%$