A general buffer scheme for the windows scheduling problem

DOI10.1145/1412228.1412234MaRDI QIDQ5406175zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1412228.1412234

zbMATH Keywords

periodic schedulingmedia-on-demand

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Communication networks in operations research (90B18)

Recommendations

• Experimental and Efficient Algorithms
• Windows Scheduling Problems for Broadcast Systems
• scientific article; zbMATH DE number 2119694
• scientific article; zbMATH DE number 2079413
• Algorithms and Computation

Cited in

(9)

• Windows scheduling of arbitrary-length jobs on multiple machines
• scientific article; zbMATH DE number 2079413 (Why is no real title available?)
• Dynamic windows scheduling with reallocation
• Bus and buffer usage in in-home digital networks: applying the dantzig-wolfe decomposition
• Scheduling techniques for media-on-demand
• Windows Scheduling Problems for Broadcast Systems
• Algorithms and Computation
• The time buffer approximated buffer allocation problem: a row-column generation approach
• scientific article; zbMATH DE number 2119694 (Why is no real title available?)

This page was built for publication: A general buffer scheme for the windows scheduling problem

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