Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2021

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.
Fichier principal
Vignette du fichier
20210213_DomBasedAnchRob_HAL.pdf (411.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02938158 , version 1 (14-09-2020)
hal-02938158 , version 2 (22-06-2021)

Identifiers

Cite

Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau. Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. European Journal of Operational Research, 2021, 295 (1), pp.22-33. ⟨10.1016/j.ejor.2021.02.034⟩. ⟨hal-02938158v2⟩
211 View
130 Download

Altmetric

Share

Gmail Facebook X LinkedIn More