Pages that link to "Item:Q2356122"
From MaRDI portal
The following pages link to A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122):
Displaying 5 items.
- A note on the paper ``Minimizing total tardiness on parallel machines with preemptions'' (Q398870) (← links)
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667) (← links)
- A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times (Q1941204) (← links)
- Note on ``Parallel machine scheduling with batch setup times'' (Q2781100) (← links)
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)