CMA Intermediate · Operations Management and Strategic Management · Scheduling and Queuing Models
Johnson's rule gives an optimal sequence for which of the following situations?
Johnson's rule is meant for minimising the total elapsed time (makespan) when n jobs must pass through two machines in the same order. It does not address due dates, assignment costs or queue waiting times.
- AMinimising total elapsed time for n jobs processed in the same order on two machinesCorrect
- BMinimising the number of late jobs on a single machine
- CAssigning n jobs to n machines at minimum cost
- DMinimising average waiting time in a queue with Poisson arrivals
Explanation
Johnson's rule minimises makespan for n jobs on two machines with the same machine order. Late-job minimisation is Moore's algorithm, cost assignment is the Hungarian method, and queue waiting is handled by queuing models.
Did you get it right without looking?
One question tells you little. A timed set on Scheduling and Queuing Models shows your real accuracy, how long you take and where you lose marks.
More Scheduling and Queuing Models questions
- In Johnson's rule for sequencing n jobs through two machines (M1 then M2), which step correctly describes how the optimal sequence is built?
- At a toll plaza lane modelled as M/M/1, vehicles arrive at an average of 40 per hour and the booth serves an average of 50 per hour. What is…
- Mehta Fabricators receives an order that must be delivered on 30 June. The planner starts from 30 June and works back through each operation…
- In the standard M/M/1 queuing model, the first M, the second M and the 1 respectively describe:
- A bank branch has 3 tellers working as an M/M/3 system. Customers arrive at an average of 20 per hour and each teller serves an average of 1…
- In production scheduling, a Gantt load chart is primarily used to show which of the following?