Damien Prot

Publication Activity (10 Years)

Years Active: 2010-2018
Publications (10 Years): 4

Top Topics

Scheduling Problem

Total Tardiness

Parallel Machines

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

Damien Prot, Odile Bellenguez-Morineau
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems. J. Sched. 21 (1) (2018)
Agnès Le Roux, Odile Bellenguez-Morineau, Christelle Guéret, Damien Prot
Complexity of a one-to-one meeting scheduling problem with two types of actors. J. Oper. Res. Soc. 66 (10) (2015)
Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines. J. Sched. 18 (3) (2015)
Damien Prot, Odile Bellenguez-Morineau
Impact of precedence constraints on complexity of scheduling problems: a survey. CoRR (2015)
Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot
A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines. CoRR (2014)
Damien Prot, Christophe Rapine, S. Constans, Rémy Fondacci
A 4D-sequencing approach for air traffic management. Eur. J. Oper. Res. 237 (2) (2014)
Tanguy Lapègue, Odile Bellenguez-Morineau, Damien Prot
A constraint-based approach for the shift design personnel task scheduling problem with equity. Comput. Oper. Res. 40 (10) (2013)
Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012). J. Sched. 16 (4) (2013)
Damien Prot, Christophe Rapine
Approximations for the Two-Machine Cross-Docking Flow Shop Problem. Discret. Appl. Math. 161 (13-14) (2013)
Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria. Eur. J. Oper. Res. 231 (2) (2013)
Damien Prot, Odile Bellenguez-Morineau
Tabu search and lower bound for an industrial complex shop scheduling problem. Comput. Ind. Eng. 62 (4) (2012)
Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010] CoRR (2011)
Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou
Refining the boundary between P and NP for identical machine scheduling problems with preemption and release dates CoRR (2011)
Damien Prot, Christophe Rapine, S. Constans, Rémy Fondacci
Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate. Eur. J. Oper. Res. 207 (1) (2010)