A decomposition approach for a resource constrained scheduling problem

DOI10.1016/0377-2217(94)90189-9zbMath0809.90081OpenAlexW2072516354MaRDI QIDQ1333515

Maria Grazia Speranza, Paolo Serafini

Publication date: 15 September 1994

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)90189-9

zbMATH Keywords

decision support systemjob shopresource constrained scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A decomposition approach in a DSS for a resource constrained scheduling problem ⋮ Scheduling independent tasks with multiple modes ⋮ A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods ⋮ An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem ⋮ Heuristics for multimode scheduling problems with dedicated resources

Cites Work

• The one-machine sequencing 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
• On general routing problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item