1 citations · 2 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2015★ 1 cited
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…
cs.CC2014★ 1 cited
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…