Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures

Autor: Philippe Chrétienne

Publikováno v: Journal of Scheduling. 23:135-143

We investigate the problem of keeping the maximum number of starting times of a baseline schedule if some machines happen to be out of order when the baseline schedule is to be implemented. If the machines are identical, we show that the problem is p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4a856aac09a02d9f58feb8082fc4477e
https://doi.org/10.1007/s10951-019-00621-x

Anchored Rescheduling Problems Under Generalized Precedence Constraints

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

Publikováno v: Combinatorial Optimization, 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020
ISCO: International Symposium on Combinatorial Optimization
ISCO: International Symposium on Combinatorial Optimization, May 2020, Montreal, QC, Canada. pp.156-166, ⟨10.1007/978-3-030-53262-8_13⟩
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO

International audience; 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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8efaf9f506c0b66e8db67f834bc1bfe
https://hal.archives-ouvertes.fr/hal-02990480

A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines

Autor: Philippe Chrétienne, Alain Quilliot

Publikováno v: Discrete Applied Mathematics. 243:132-139

In this paper, we consider the homogeneous m -machine scheduling problem where unit-time jobs have to be scheduled within their time windows so that, for any subset of machines, the set of the time units at which at least one machine is busy, is an i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a28fae90acc283644d5883406d9b4ad4
https://doi.org/10.1016/j.dam.2018.02.011

Stabilisation de solutions en optimisation combinatoire par des modèles d'ancrage; application à l'arbre couvrant

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

Publikováno v: ROADEF-20ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision
ROADEF-20ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Feb 2019, Le Havre, France
HAL

National audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5488f9dd762a76e45fbd25693a776bf7
https://hal.archives-ouvertes.fr/hal-02990535

Anchored reactive and proactive solutions to the CPM-scheduling problem

Autor: Philippe Chrétienne, Pascale Bendotti, Alain Quilliot, Pierre Fouilhoux

Publikováno v: European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2017, 261 (1), pp.67-74. ⟨10.1016/j.ejor.2017.02.007⟩
European Journal of Operational Research, 2017, 261 (1), pp.67-74. ⟨10.1016/j.ejor.2017.02.007⟩

International audience; In a combinatorial optimization problem under uncertainty, it is never the case that the real instance is exactly the baseline instance that has been solved earlier. The anchorage level is the number of individual decisions wi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::269b6302735bb792b7ca5799b764e8fa
https://hal.archives-ouvertes.fr/hal-01545599