COMPLEXITY OF THE PROJECT SEQUENCING PROBLEM.

V. Akileswaran; G. B. Hazen; T. L. Morin

doi:10.1287/opre.31.4.772

COMPLEXITY OF THE PROJECT SEQUENCING PROBLEM.

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

^*Corresponding author for this work

Industrial Engineering and Management Sciences

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	772-778
Number of pages	7
Journal	Operations Research
Volume	31
Issue number	4
DOIs	https://doi.org/10.1287/opre.31.4.772
State	Published - Jan 1 1983

ASJC Scopus subject areas

Computer Science Applications
Management Science and Operations Research

Access to Document

10.1287/opre.31.4.772

Cite this

@article{f3b058a743bf4956999d95b5cf7a47d2,

title = "COMPLEXITY OF THE PROJECT SEQUENCING PROBLEM.",

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.",

author = "V. Akileswaran and Hazen, {G. B.} and Morin, {T. L.}",

year = "1983",

month = jan,

day = "1",

doi = "10.1287/opre.31.4.772",

language = "English (US)",

volume = "31",

pages = "772--778",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

number = "4",

}

TY - JOUR

T1 - COMPLEXITY OF THE PROJECT SEQUENCING PROBLEM.

AU - Akileswaran, V.

AU - Hazen, G. B.

AU - Morin, T. L.

PY - 1983/1/1

Y1 - 1983/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0020794420&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020794420&partnerID=8YFLogxK

U2 - 10.1287/opre.31.4.772

DO - 10.1287/opre.31.4.772

M3 - Article

AN - SCOPUS:0020794420

SN - 0030-364X

VL - 31

SP - 772

EP - 778

JO - Operations Research

JF - Operations Research

IS - 4

ER -

COMPLEXITY OF THE PROJECT SEQUENCING PROBLEM.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this