A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem

DOI10.1016/j.orl.2022.08.003OpenAlexW4294989843MaRDI QIDQ2084041

Marc Goerigk, Matthew Bold

Publication date: 17 October 2022

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

Full work available at URL: https://arxiv.org/abs/2203.06983

zbMATH Keywords

project schedulingbudgeted uncertaintyrobust optimisationoptimisation under uncertainty

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

\(\Gamma\)-robust optimization of project scheduling problems ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• PSPLIB -- a project scheduling problem library
• A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem
• A robust optimization approach for the multi-mode resource-constrained project scheduling problem
• Dominance-based linear formulation for the anchor-robust project scheduling problem
• A compact reformulation of the two-stage robust resource-constrained project scheduling problem
• The Price of Robustness
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Benchmarking optimization software with performance profiles.

This page was built for publication: A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem