In sequencing jobs in a flow shop with two resources, Johnson's rule finds a sequence that has the smallest makespan.

Question

Quizplus · Accepted Answer

Johnson's rule is a heuristic algorithm used to find an optimal sequence for a flow shop with two resources. It works by selecting the job with the smallest processing time on either the first or last machine, and then comparing the remaining jobs' processing times to determine the next job to schedule. This process is repeated until all jobs have been scheduled. The resulting sequence has been proven to have the smallest possible makespan. Therefore, the statement that Johnson's rule finds the sequence with the smallest makespan in a flow shop with two resources is true.

In Sequencing Jobs in a Flow Shop with Two Resources