Anchored Rescheduling Problems Under Generalized Precedence Constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Anchored Rescheduling Problems Under Generalized Precedence Constraints


The anchored rescheduling problem, recently introduced in the literature, is to find a schedule under precedence constraints with a maximum number of prescribed starting times. Namely, prescribed starting times may correspond to a former schedule that must be modified while maintaining a maximum number of starting times unchanged. In the present work two extensions are investigated. First we introduce a new tolerance feature, so that starting times can be considered as unchanged when modified less than a tolerance threshold. The sensitivity of the anchored rescheduling problem to tolerance is studied. Second we consider generalized precedence constraints, which include, e.g., deadline constraints. Altogether this leads to a more realistic rescheduling problem. The main result is to show that the problem is polynomial. We discuss how to benefit from the polynomiality result in a machine scheduling environment.
Not file

Dates and versions

hal-02990480 , version 1 (05-11-2020)



Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau. Anchored Rescheduling Problems Under Generalized Precedence Constraints. ISCO: International Symposium on Combinatorial Optimization, May 2020, Montreal, QC, Canada. pp.156-166, ⟨10.1007/978-3-030-53262-8_13⟩. ⟨hal-02990480⟩
23 View
0 Download



Gmail Facebook Twitter LinkedIn More