Complexity of the Project Sequencing Problem

DOI10.1287/OPRE.31.4.772MaRDI QIDQ3325432zbMATH OpenOpenAlexFDO

Authors V. Akileswaran, Gordon B. Hazen, Thomas 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 complexityNP-completenesspolynomial time algorithmproject sequencing

Mathematics Subject Classification ID

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

Recommendations

• Complexity of a class of task scheduling problems
• The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
• Computational complexity of some scheduling problems with multiprocessor tasks
• Complexity of some project scheduling problem with nonrenewable resources
• On the complexity of the car sequencing problem.

Cited in

(6)

• Average cost expansion sequencing
• Heuristic methods and applications: A categorized survey
• Analyzing linear recursive projects as an absorbing chain
• Complexity of a class of task scheduling problems
• Multi-facility capacity expansion in R&D projects
• Optimizing the strategic patient mix combining queueing theory and dynamic programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325432)