Complexity of Scheduling under Precedence Constraints

J. K. Lenstra and A. H. G. Rinnooy Kan
Additional contact information
J. K. Lenstra: Mathematisch Centrum, Amsterdam, The Netherlands
A. H. G. Rinnooy Kan: Erasmus University, Rotterdam, The Netherlands

Operations Research, 1978, vol. 26, issue 1, 22-35

Abstract: Precedence constraints between jobs that have to be respected in every feasible schedule generally increase the computational complexity of a scheduling problem. Occasionally, their introduction may turn a problem that is solvable within polynomial time into an NP -complete one, for which a good algorithm is highly unlikely to exist. We illustrate the use of these concepts by extending some typical NP -completeness results and simplifying their correctness proofs for scheduling problems involving precedence constraints.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.22 (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:22-35

Access Statistics for this article

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