Date of Award
Doctor of Philosophy
The problem of scheduling a flow shop is discussed, and a general structure for paired-comparison based scheduling algorithms is identified;A special such algorithm for three machines is introduced, and the complete 3-machine adaptation of Johnson's algorithm, suggested by Burns and Rooker is extended to the case of an arbitrary number of machines.
Digital Repository @ Iowa State University, http://lib.dr.iastate.edu/
Dehghan-Nayeri, Majid, "Johnson-type algorithms for m-machine flow shops " (1981). Retrospective Theses and Dissertations. 7161.