Complexity of the Project Sequencing Problem

V. Akileswaran, G. B. Hazen and T. L. Morin
Additional contact information
V. Akileswaran: Tektronix, Inc., Beaverton, Oregon
G. B. Hazen: Northwestern University, Evanston, Illinois
T. L. Morin: Purdue University, West Lafayette, Indiana

Operations Research, 1983, vol. 31, issue 4, 772-778

Abstract: This paper analyzes the computational complexity of the project sequencing problem. Specifically, we prove that the general decision problem is NP-complete, but note that an important special case is solvable in polynomial time.

Keywords: 432 computational complexity; 475 water resources development; 625 enumerative and heuristic algorithms (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.4.772 (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:31:y:1983:i:4:p:772-778

Access Statistics for this article

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