A Note on Heuristics of Flow-Shop Scheduling

Tsung-Chyan Lai
Additional contact information
Tsung-Chyan Lai: National Taiwan University, Taiwan

Operations Research, 1996, vol. 44, issue 4, 648-652

Abstract: We present an O ( mn ) two-group (TG) heuristic for the m -machine, n -job permutation flow-shop scheduling problem. We show that heuristic TG has a worst-case performance ratio of ( m + 1)/2. We also establish worst-case bounds for several heuristics proposed in the past.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.44.4.648 (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:4:p:648-652

Access Statistics for this article

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