Degree Type
Dissertation
Date of Award
1981
Degree Name
Doctor of Philosophy
Department
Statistics
Abstract
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.
DOI
https://doi.org/10.31274/rtd-180813-5376
Publisher
Digital Repository @ Iowa State University, http://lib.dr.iastate.edu/
Copyright Owner
Majid Dehghan-Nayeri
Copyright Date
1981
Language
en
Proquest ID
AAI8122508
File Format
application/pdf
File Size
68 pages
Recommended Citation
Dehghan-Nayeri, Majid, "Johnson-type algorithms for m-machine flow shops " (1981). Retrospective Theses and Dissertations. 7161.
https://lib.dr.iastate.edu/rtd/7161
