Pages that link to "Item:Q2414478"
From MaRDI portal
The following pages link to Schedules with a single preemption on uniform parallel machines (Q2414478):
Displaying 9 items.
- Minimizing makespan and preemption costs on a system of uniform machines (Q818662) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← 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)
- Power of Preemption on Uniform Parallel Machines (Q2969634) (← links)
