PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION
From MaRDI portal
Publication:3655542
DOI10.1142/S012905410900708XzbMath1186.68066MaRDI QIDQ3655542
Joseph Y.-T. Leung, Yumei Huo, Xin Wang
Publication date: 8 January 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
makespan minimization; preemptive scheduling; polynomial-time algorithms; inclusive processing set; nested processing set
68W05: Nonnumerical algorithms
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Cites Work
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Parallel machine scheduling under a grade of service provision
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Scheduling with Deadlines and Loss Functions
- Scheduling parallel machines with inclusive processing set restrictions
- Task Scheduling on a Multiprocessor System with Independent Memories
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Parallel machine scheduling with job assignment restrictions