PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION

DOI10.1142/S012905410900708XzbMath1186.68066MaRDI QIDQ3655542

Yumei Huo, Xin Wang, Joseph Y.-T. Leung

Publication date: 8 January 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

makespan minimizationpreemptive schedulingpolynomial-time algorithmsinclusive processing setnested processing set

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Robust algorithms for preemptive scheduling

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

This page was built for publication: PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION