Little-preemptive scheduling on unrelated processors
From MaRDI portal
(Redirected from Publication:1868263)
Recommendations
- On the complexity of constructing multiprocessor little-preemptive schedules
- Optimal Preemptive Scheduling of Two Unrelated Processors
- Preemptive Scheduling of Uniform Processor Systems
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
- Real-time uniprocessor scheduling with fewer preemptions
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- Scheduling Independent Tasks on Uniform Processors
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Preemptive scheduling on a small number of hierarchical machines
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
Cited in
(10)- How small are shifts required in optimal preemptive schedules?
- Real-time uniprocessor scheduling with fewer preemptions
- Optimal Preemptive Scheduling of Two Unrelated Processors
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- On the complexity of scheduling unrelated parallel machines with limited preemptions
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling
- Minimizing makespan and preemption costs on a system of uniform machines
- scientific article; zbMATH DE number 1947446 (Why is no real title available?)
- Parallel Processor Scheduling with Limited Number of Preemptions
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
This page was built for publication: Little-preemptive scheduling on unrelated processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868263)
