A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Johnson  gave an efficient algorithm for minimizing makespan in a two-rnachine flow shop; there is no advantage to preemption in this case. McNaughton's wrap-around Nle  finds a shortest preemptive schedule on identical parallel machines in Unear time. A simi-1ar1y efficient aJgorithm is unlikely to exist for the simplest common generalization of these pr0blems. We show that preemptive scheduling in a two-stage flow shop with at least two identical parallel machines in one of thedoi:10.1016/0377-2217(94)00235-5 fatcat:2dpe64hanjgavaofqasiwjjamy