A clock manufacturing company is planning an assembly line to produce 195 clocks per 8-hour shift. The following table gives the work elements, times and immediate predecessors :
Work Elements | Time (in seconds) | Immediate Predecessors
A | 40 | None
B | 80 | A
C | 30 | D, E, F
D | 25 | B
E | 20 | B
F | 15 | B
G | 120 | A
H | 145 | G
I | 130 | H
J | 115 | C, I
(i) What is the desired cycle time (in seconds)?
(ii) What is the theoretical minimum number of stations?
(iii) Show your solution on a precedence diagram.
(iv) What are the efficiency and balance delay of the solution found?
15 marks · directive: Calculate
The core of a good answer
Desired cycle time = 28,800/195 ≈ 147.69 seconds; theoretical minimum = 720/147.69 = 4.875, so 5 stations; a feasible 5-station balance {A,B,D}, {G,E}, {H}, {I,F}, {C,J} gives efficiency 97.5 per cent and balance delay 2.5 per cent.
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
An assembly line balancing problem: compute cycle time from the required output, the theoretical minimum number of stations from total work content, draw the precedence network, assign elements to stations with a heuristic (largest eligible element first) without exceeding the cycle time, then compute efficiency and balance delay.
Answer outline
Introduction
Given: output 195 clocks per 8-hour shift (28,800 seconds), ten work elements with total work content 40 + 80 + 30 + 25 + 20 + 15 + 120 + 145 + 130 + 115 = 720 seconds.
Step 1: Desired cycle time (i)
- C = available time / required output = (8 × 3,600) / 195 = 28,800 / 195 = 147.69 seconds per clock.
Step 2: Theoretical minimum stations (ii)
- N(t) = Σt / C = 720 / 147.69 = 4.875, rounded up to 5 stations.
Step 3: Precedence diagram (iii)
- A is the start node; arrows A → B and A → G.
- From B arrows go to D, E and F; D, E and F all lead into C.
- G → H → I in a chain.
- C and I both lead into J, the final element.
Step 4: Station assignment (largest eligible element that fits, C = 147.69)
- Station 1: A (40) + B (80) + D (25) = 145 s; idle 2.69 s.
- Station 2: G (120) + E (20) = 140 s; idle 7.69 s.
- Station 3: H (145) = 145 s; idle 2.69 s.
- Station 4: I (130) + F (15) = 145 s; idle 2.69 s.
- Station 5: C (30) + J (115) = 145 s; idle 2.69 s.
- Precedence check: C comes after D, E and F (stations 1, 2, 4) and J after C and I.
Step 5: Efficiency and balance delay (iv)
- Efficiency = Σt / (n × C) = 720 / (5 × 147.69) = 720 / 738.46 = 0.975 = 97.5 per cent.
- Balance delay = 1 - efficiency = 2.5 per cent; total idle time = 738.46 - 720 = 18.46 seconds per cycle.
Conclusion
Five stations, the theoretical minimum, are achieved, so the balance is optimal in number of stations: efficiency 97.5 per cent, balance delay 2.5 per cent. Check: each station load is at most 147.69 seconds and all precedence relations hold; the assignment was rechecked by a Python simulation of the heuristic.
Examples and data to cite
- If the actual cycle time is taken as the largest station time (145 s), efficiency becomes 720/(5 × 145) = 99.3 per cent, but output would then be 28,800/145 ≈ 198 clocks, above the target.
Facts to remember
- Cycle time C = productive time per period / required output per period.
- Theoretical minimum stations N(t) = Σt / C, rounded up.
- Efficiency = Σt / (n × C); balance delay = 1 - efficiency.