The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations

Jeffrey B. Sidney
Additional contact information
Jeffrey B. Sidney: University of Ottawa, Ottawa, Ontario

Operations Research, 1979, vol. 27, issue 4, 782-791

Abstract: The n -job 2-machine flow shop problem with series-parallel precedence constraints is considered with the objective to minimize makespan. Recent results of Kurisu are utilized in the development of a polynomial bounded optimal algorithm.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.4.782 (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:27:y:1979:i:4:p:782-791

Access Statistics for this article

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