GATE 2025 PI – Question 49
Six indivisible tasks occur sequentially in a single-line layout, taking 37,8,19,34,36,17 minutes. Find the number of stations needed to minimize cycle time (integer).
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: 5 to 5
Explanation
The longest indivisible task bounds minimum cycle time at 37 minutes. Total work is 151 minutes, so at least $\lceil151/37\rceil=5$ stations are needed. A feasible sequential assignment is [37], [8+19], [34], [36], [17]. It attains cycle time 37 with **five stations**.