Optimal Sequencing by Modular Decomposition: Polynomial Algorithms

Jeffrey B. Sidney and George Steiner
Additional contact information
Jeffrey B. Sidney: University of Ottawa, Ontario, Canada
George Steiner: McMaster University, Hamilton, Ontario, Canada

Operations Research, 1986, vol. 34, issue 4, 606-612

Abstract: We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing problems in polynomial time for substantially larger classes of precedence constraints than previously realized. The algorithm's efficiency depends on the maximum number of jobs that are not related by the precedence constraints in certain subsets of the jobs. We also demonstrate how to modify this general algorithm lo take advantage of special problem characteristics.

Keywords: 112 scheduling precedence constraints; 584 polynomial algorithms by modular decomposition (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.4.606 (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:34:y:1986:i:4:p:606-612

Access Statistics for this article

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