Pages that link to "Item:Q2015808"
From MaRDI portal
The following pages link to Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808):
Displaying 8 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)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← 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)
- Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687) (← links)
