Pages that link to "Item:Q1868263"
From MaRDI portal
The following pages link to Little-preemptive scheduling on unrelated processors (Q1868263):
Displaying 7 items.
- Real-time uniprocessor scheduling with fewer preemptions (Q682422) (← links)
- Minimizing makespan and preemption costs on a system of uniform machines (Q818662) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- Optimal Preemptive Scheduling of Two Unrelated Processors (Q4025916) (← links)
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders (Q5902163) (← links)