The following pages link to A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122):
Displayed 1 item.