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.
CITATION STYLE
Bendotti, P., Chrétienne, P., Fouilhoux, P., & Pass-Lanneau, A. (2020). Anchored rescheduling problems under generalized precedence constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12176 LNCS, pp. 156–166). Springer. https://doi.org/10.1007/978-3-030-53262-8_13
Mendeley helps you to discover research relevant for your work.