1 citations · 2 across the 3 of their papers we have counts for
4 papers
How the structure of precedence constraints may change the complexity class of scheduling problems
Damien Prot, Odile Bellenguez-Morineau
This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems. Indeed many problems can be NP-hard…
A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines
Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr +1
In the paper "The complexity of mean flow time scheduling problems with release times", by Baptiste, Brucker, Chrobak, Dürr, Kravchenko and Sourd, the authors claimed to prove stro…
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]
D. Prot, O. Bellenguez-Morineau, C. Lahlou
In this note, we point out two major errors in the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]. More precisely, they pr…
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
D. Prot, O. Bellenguez-Morineau, C. Lahlou
In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in case of a regular criterion to be minimized. We show that so…