Anchored reactive and proactive solutions to the CPM-scheduling problem

DOI10.1016/j.ejor.2017.02.007zbMath1403.90303OpenAlexW2589605281MaRDI QIDQ1753557

Alain Quilliot, Pierre Fouilhoux, Pascale Bendotti, Philippe Chrétienne

Publication date: 29 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.02.007

zbMATH Keywords

schedulingrobust optimizationanchored solutions

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Reactive and proactive single-machine scheduling to maintain a maximum number of starting times ⋮ \(\Gamma\)-robust optimization of project scheduling problems ⋮ A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty ⋮ Dominance-based linear formulation for the anchor-robust project scheduling problem ⋮ Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust solutions of uncertain linear programs
• Project scheduling. A research handbook.
• Robust discrete optimization and network flows
• The construction of stable project baseline schedules
• Regularized robust optimization: the optimal portfolio execution case
• A decomposition theorem for partially ordered sets
• Robust Solutions to Uncertain Semidefinite Programs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming