Preemptive scheduling algorithms with nested processing set restriction

DOI10.1142/S012905410900708XMaRDI QIDQ3655542zbMATH OpenFDO

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

Publication date 8 January 2010

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

Full work available at URL https://doi.org/10.1142/S012905410900708X

zbMATH Keywords

inclusive processing setmakespan minimizationnested processing setpolynomial-time algorithmspreemptive scheduling

Mathematics Subject Classification ID

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

Recommendations

• Parallel machine scheduling with nested processing set restrictions
• A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
• Fast approximation algorithms for job scheduling with processing set restrictions
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Parallel batch scheduling with nested processing set restrictions

Cites work

• An optimal rounding gives a better approximation for scheduling unrelated machines
• Approximation algorithms for scheduling unrelated parallel machines
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Parallel machine scheduling under a grade of service provision
• Parallel machine scheduling with job assignment restrictions
• Scheduling parallel machines with inclusive processing set restrictions
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Scheduling with deadlines and loss functions
• Task Scheduling on a Multiprocessor System with Independent Memories

Cited in

(4)

• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Fast approximation algorithms for job scheduling with processing set restrictions
• Robust algorithms for preemptive scheduling
• A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions

This page was built for publication: Preemptive scheduling algorithms with nested processing set restriction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655542)