Johnson-type algorithms for m-machine flow shops

Date
1981
Authors
Dehghan-Nayeri, Majid
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Statistics
Organizational Unit
Journal Issue
Series
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.

Description
Keywords
Statistics, Engineering Valuation
Citation
Source