HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem

Abstract : In project scheduling under processing times uncertainty, the Anchor-Robust Project Scheduling Problem is to find a baseline schedule of bounded makespan and a max-weight subset of jobs whose starting times are guaranteed. The problem was proven NP-hard even for budgeted uncertainty. In the present work we design mixed-integer programming (MIP) formulations that are valid for a variety of uncertainty sets encompassing budgeted uncertainty. A new dominance among solutions is proposed, resulting into an MIP formulation. We further study the combinatorial structure of the problem. Non-trivial polynomial cases under budgeted uncertainty are exhibited, where the dominance-based formulation yields a polyhedral characterization of integer solutions. In more general cases, the dominance-based formulation is shown to be tighter than all previously known formulations. In numerical experiments we investigate how the formulation performs on instances around the polynomial cases, for both budgeted uncertainty sets and more elaborate uncertainty sets involving several budgets.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Contributor : Adèle Pass-Lanneau Connect in order to contact the contributor
Submitted on : Tuesday, June 22, 2021 - 10:41:17 PM
Last modification on : Tuesday, January 4, 2022 - 5:53:30 AM


Files produced by the author(s)


  • HAL Id : hal-02938158, version 2


Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau. Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. 2021. ⟨hal-02938158v2⟩



Record views


Files downloads