On the connection between a cyclic job shop and a reentrant flow shop scheduling problem

Hall et al. (J. Sched. 2002; 5:307–327) investigated the cycle time minimization problem in a two-machine job shop, where each job consists of at most three operations. In this note, we reduce the problem to a two-machine reentrant flow shop problem and briefly discuss some consequences.