A decomposition approach in a DSS for a resource constrained scheduling problem

DOI10.1016/0377-2217(94)90352-2zbMath0819.90046OpenAlexW2011605233MaRDI QIDQ1342055

Maria Grazia Speranza, Paolo Serafini

Publication date: 9 February 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90352-2

zbMATH Keywords

project schedulingdecompositionsequencingdecision support systemassignmentcomplex resource constrained scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items

An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem

Cites Work

• A decomposition approach for a resource constrained scheduling problem
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Hierarchical models for multi-project planning and scheduling
• Finding Minimum-Cost Circulations by Successive Approximation
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A Review of Production Scheduling
• On general routing problems
• Unnamed Item
• Unnamed Item