Pages that link to "Item:Q5704855"
From MaRDI portal
The following pages link to Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855):
Displaying 12 items.
- A note on the paper ``Minimizing total tardiness on parallel machines with preemptions'' (Q398870) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- Minimizing the number of late jobs on unrelated machines (Q811339) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- Preemptive scheduling in the presence of transportation times (Q1010294) (← links)
- Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- Minimizing Average Flow Time on Unrelated Machines (Q3602830) (← links)
- Preemptive parallel‐machine scheduling with a common server to minimize makespan (Q4632980) (← links)