Dispatching in perfectly-periodic schedules

DOI10.1016/S0196-6774(03)00089-0zbMath1060.68013OpenAlexW1966261337MaRDI QIDQ4458866

Boaz Patt-Shamir, Zvika Brakerski, Vladimir Dreizin

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

space complexitydispatching algorithms

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Windows scheduling of arbitrary-length jobs on multiple machines ⋮ Modeling and solving the periodic maintenance problem