COMPLEXITY OF THE PROJECT SEQUENCING PROBLEM.

V. Akileswaran*, G. B. Hazen, T. L. Morin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

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

Original languageEnglish (US)
Pages (from-to)772-778
Number of pages7
JournalOperations Research
Volume31
Issue number4
DOIs
StatePublished - Jan 1 1983

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'COMPLEXITY OF THE PROJECT SEQUENCING PROBLEM.'. Together they form a unique fingerprint.

Cite this