Dispatching in perfectly-periodic schedules

DOI10.1016/S0196-6774(03)00089-0MaRDI QIDQ4458866zbMATH OpenOpenAlexFDO

Authors Zvika Brakerski, Vladimir Dreizin, Boaz Patt-Shamir

Publication date 14 March 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00089-0

zbMATH Keywords

dispatching algorithmsspace complexity

Mathematics Subject Classification ID

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

Recommendations

• General perfectly periodic scheduling
• General perfectly periodic scheduling
• Nearly optimal perfectly-periodic schedules
• Periodic Scheduling with Service Constraints
• Optimal scheduling in a periodic environment
• Scheduling periodic tasks on uniform multiprocessors
• Nearly optimal perfectly periodic schedules
• Efficient algorithms for periodic scheduling

Cited in

(8)

• Windows scheduling of arbitrary-length jobs on multiple machines
• Modeling and solving the periodic maintenance problem
• General perfectly periodic scheduling
• Nearly optimal perfectly-periodic schedules
• Balancing perfectly periodic service schedules: an application from recycling and waste management
• Perfect periodic scheduling for binary tree routing in wireless networks
• Perfect periodic scheduling for three basic cycles
• General perfectly periodic scheduling

This page was built for publication: Dispatching in perfectly-periodic schedules

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