A note on $${\mathbb {NP}}$$ NP -hardness of preemptive mean flow-time scheduling for parallel machines
Crossref DOI link: https://doi.org/10.1007/s10951-014-0380-2
Published Online: 2014-05-16
Published Print: 2015-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bellenguez-Morineau, Odile
Chrobak, Marek
Dürr, Christoph
Prot, Damien
Text and Data Mining valid from 2014-05-16