Damien Prot

According to our database, Damien Prot authored at least 13 papers between 2010 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems.

Damien Prot, Odile Bellenguez-Morineau

J. Sched., 2018

2015

A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines.

Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot

J. Sched., 2015

Complexity of a one-to-one meeting scheduling problem with two types of actors.

Agnès Le Roux, Odile Bellenguez-Morineau, Christelle Guéret, Damien Prot

J. Oper. Res. Soc., 2015

Impact of precedence constraints on complexity of scheduling problems: a survey.

Damien Prot, Odile Bellenguez-Morineau

CoRR, 2015

2014

A 4D-sequencing approach for air traffic management.

Damien Prot, Christophe Rapine, S. Constans, Rémy Fondacci

Eur. J. Oper. Res., 2014

2013

A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012).

Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou

J. Sched., 2013

New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria.

Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou

Eur. J. Oper. Res., 2013

Approximations for the Two-Machine Cross-Docking Flow Shop Problem.

Damien Prot, Christophe Rapine

Discret. Appl. Math., 2013

A constraint-based approach for the shift design personnel task scheduling problem with equity.

Tanguy Lapègue, Odile Bellenguez-Morineau, Damien Prot

Comput. Oper. Res., 2013

2012

Tabu search and lower bound for an industrial complex shop scheduling problem.

Damien Prot, Odile Bellenguez-Morineau

Comput. Ind. Eng., 2012

2011

Refining the boundary between P and NP for identical machine scheduling problems with preemption and release dates

Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou

CoRR, 2011

A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]

Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou

CoRR, 2011

2010

Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate.

Damien Prot, Christophe Rapine, S. Constans, Rémy Fondacci

Eur. J. Oper. Res., 2010