A simple optimal algorithm for scheduling variable-sized requests

DOI10.1016/S0020-0190(98)00177-XMaRDI QIDQ293470zbMATH OpenOpenAlexFDO

Authors Janelle J. Harms

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S002001909800177X?np=y

zbMATH Keywords

optimalityschedulingcommunication networksadvance reservation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Communication networks in operations research (90B18)

Recommendations

• Performance of scheduling algorithms for channel reservation
• scientific article; zbMATH DE number 4023001
• Resource scheduling with variable requirements over time
• Algorithm of sequential analysis of variants for minimization of the number of devices in scheduling problem with due date
• scientific article; zbMATH DE number 431494

Cites work

• Scheduling jobs with fixed start and end times

Cited in

(6)

• Algorithms and time complexity of the request-service problem
• scientific article; zbMATH DE number 56358 (Why is no real title available?)
• Optimal packet-to-slot assignment in mobile telecommunications
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• scientific article; zbMATH DE number 431494 (Why is no real title available?)
• Performance of scheduling algorithms for channel reservation

This page was built for publication: A simple optimal algorithm for scheduling variable-sized requests

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