Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP

DOI10.1007/s10479-023-05537-6MaRDI QIDQ6581390

Luca Brunod-Indrigo, Pascale Bendotti, Adèle Pass-Lanneau

Publication date: 30 July 2024

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

zbMATH Keywords

heuristicsproject schedulingRCPSPanchored solutionsrobust 2-stage optimizationMIP reformulations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Robustness in mathematical programming (90C17)

Cites Work

• Models and algorithms for robust PERT scheduling with time-dependent tast durations
• Insertion techniques for static and dynamic resource-constrained project scheduling.
• Adjustable robust solutions of uncertain linear programs
• A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem
• Anchored reactive and proactive solutions to the CPM-scheduling problem
• Project scheduling under uncertainty: survey and research potentials
• The construction of stable project baseline schedules
• Anchored rescheduling problems under generalized precedence constraints
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• A compact reformulation of the two-stage robust resource-constrained project scheduling problem
• The Price of Robustness
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• The Anchor-Robust Project Scheduling Problem

This page was built for publication: Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP