Permutation Schedules for Flow Shops with Precedence Constraints

Kevin Ewacha, Ivan Rival and George Steiner
Additional contact information
Kevin Ewacha: University of Ottawa, Ottawa, Canada
Ivan Rival: University of Ottawa, Ottawa, Canada
George Steiner: McMaster University, Hamilton, Canada

Operations Research, 1990, vol. 38, issue 6, 1135-1139

Abstract: We show that permutation schedules are always optimal for regular, symmetric measures of performance for the m -machine flow shop with precedence constraints provided that processing times are identical for noncomparable jobs.

Keywords: production/scheduling:; flow; shops; with; precedence; constraints (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.6.1135 (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:38:y:1990:i:6:p:1135-1139

Access Statistics for this article

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