Dominance-based linear formulation for the anchor-robust project scheduling problem

DOI10.1016/j.ejor.2021.02.034zbMath1487.90270arXiv2106.12055OpenAlexW3089219556MaRDI QIDQ2239841

Adèle Pass-Lanneau, Pierre Fouilhoux, Pascale Bendotti, Philippe Chrétienne

Publication date: 5 November 2021

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

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

zbMATH Keywords

project schedulingcombinatorial optimizationmixed-integer programmingpolyhedral characterizationrobust 2-stage optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (2)

A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty ⋮ A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem

Cites Work

• Unnamed Item
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Adjustable robust solutions of uncertain linear programs
• Anchored reactive and proactive solutions to the CPM-scheduling problem
• Project scheduling under uncertainty: survey and research potentials
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The construction of stable project baseline schedules
• Anchored rescheduling problems under generalized precedence constraints
• Recent advances in robust optimization: an overview
• 2-stage robust MILP with continuous recourse variables
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Incremental Network Optimization: Theory and Algorithms
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Finite Adaptability in Multistage Linear Optimization
• Recoverable Robust Timetables: An Algorithmic Approach on Trees
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Dominance-based linear formulation for the anchor-robust project scheduling problem