A New Heuristic for Three-Machine Flow Shop Scheduling

Bo Chen, Celia A. Glass, Chris N. Potts and Vitaly A. Strusevich
Additional contact information
Bo Chen: University of Warwick, Coventry, United Kingdom
Celia A. Glass: University of Southampton, Southampton, United Kingdom
Chris N. Potts: University of Southampton, Southampton, United Kingdom
Vitaly A. Strusevich: University of Greenwich, London, United Kingdom

Operations Research, 1996, vol. 44, issue 6, 891-898

Abstract: This paper considers the problem of sequencing n jobs in a three-machine flow shop with the objective of minimizing the makespan, which is the completion time of the last job. An O ( n log n ) time heuristic that is based on Johnson's algorithm is presented. It is shown to generate a schedule with length at most 5/3 times that of an optimal schedule, thereby reducing the previous best available worst-case performance ratio of 2. An application to the general flow shop is also discussed.

Keywords: production/scheduling; flow shop; approximations/heuristic; worst-case analysis (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.44.6.891 (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:44:y:1996:i:6:p:891-898

Access Statistics for this article

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