The Lessons of Flowshop Scheduling Research

R. A. Dudek, S. S. Panwalkar and M. L. Smith
Additional contact information
R. A. Dudek: Texas Tech University, Lubbock, Texas
S. S. Panwalkar: Texas Tech University, Lubbock, Texas
M. L. Smith: Texas Tech University, Lubbock, Texas

Operations Research, 1992, vol. 40, issue 1, 7-13

Abstract: This paper reviews the flowshop-sequencing research since 1954 that has been devoted to the static deterministic case in which n jobs are to be processed through a shop in which the processing times at each stage are fixed. The paper then comments on NP-completeness, the selection of criteria for optimization, and the lack of applications of this work in industry. Finally, it draws some conclusions about the possible future of sequencing research and the lessons that this area's work has to teach the rest of operations research.

Keywords: production/scheduling; flowshop sequencing: review of research lessons for researchers (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (26)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.1.7 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:1:p:7-13

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().