Summary: A new flowshop scheduling problem related to automated manufacturing systems such as FMS’s and FMC’s is discussed. The problem is shown to be an extension of the two-machine flowshop problem addressed by Johnson (or a special case of the three machine flowshop problem), and to be NP-hard. Some solvable cases are discussed.