Pages that link to "Item:Q2957687"
From MaRDI portal
The following pages link to Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687):
Displaying 9 items.
- Parallel machine covering with limited number of preemptions (Q462268) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- Single parameter analysis of power of preemption on two and three uniform machines (Q2339808) (← links)
- Schedules with a single preemption on uniform parallel machines (Q2414478) (← links)
- The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
- Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855) (← links)
- The power of preemption on unrelated machines and applications to scheduling orders (Q5891554) (← links)