Flowshop and Jobshop Schedules: Complexity and Approximation

Teofilo Gonzalez and Sartaj Sahni
Additional contact information
Teofilo Gonzalez: University of Minnesota, Minneapolis, Minnesota
Sartaj Sahni: University of Minnesota, Minneapolis, Minnesota

Operations Research, 1978, vol. 26, issue 1, 36-52

Abstract: We show that finding minimum finish time preemptive and non-preemptive schedules for flow shops and job shops is NP-complete. Bounds on the performance of various heuristics to generate reasonably good schedules are also obtained.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (42)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.36 (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:26:y:1978:i:1:p:36-52

Access Statistics for this article

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