Anchored rescheduling problem with non-availability periods

DOI10.1016/J.ORL.2024.107201MaRDI QIDQ6988262zbMATH OpenFDO

Authors Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier

Publication date 5 May 2025

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

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107201

zbMATH Keywords

anchored reschedulingnon-availability periodsrobust two-stage scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

• A compact reformulation of the two-stage robust resource-constrained project scheduling problem
• A decomposition theorem for partially ordered sets
• A theory and algorithms for combinatorial reoptimization
• A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
• Adjustable robust solutions of uncertain linear programs
• Anchored reactive and proactive solutions to the CPM-scheduling problem
• Anchored rescheduling problems under generalized precedence constraints
• Antichain sequences
• Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP
• Models and algorithms for robust PERT scheduling with time-dependent tast durations
• Rescheduling for job unavailability
• Robust Optimization of Large-Scale Systems
• The concept of recoverable robustness, linear programming recovery, and railway applications
• The construction of stable project baseline schedules

This page was built for publication: Anchored rescheduling problem with non-availability periods

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