Complexity of the Project Sequencing Problem

DOI10.1287/opre.31.4.772zbMath0538.90035OpenAlexW2054905826MaRDI QIDQ3325432

V. Akileswaran, Gordon B. Hazen, Thomas L. Morin

Publication date: 1983

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.31.4.772

zbMATH Keywords

computational complexitypolynomial time algorithmNP-completenessproject sequencing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Optimizing the strategic patient mix combining queueing theory and dynamic programming ⋮ Average cost expansion sequencing ⋮ Multi-facility capacity expansion in R&D projects ⋮ Heuristic methods and applications: A categorized survey

This page was built for publication: Complexity of the Project Sequencing Problem