Randomized online algorithms for maximizing busy time interval scheduling

DOI10.1007/BF02309339MaRDI QIDQ1909593zbMATH OpenFDO

Authors U. Faigle, R. Garbe, Walter Kern

Publication date 17 March 1996

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

busy timeprobabilistic online algorithm

Mathematics Subject Classification ID

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

Recommendations

• Online Interval Scheduling: Randomized and Multiprocessor Cases
• Busy time scheduling on a bounded number of machines (extended abstract)
• Online interval scheduling: Randomized and multiprocessor cases
• Online optimization of busy time on parallel machines
• Online optimization of busy time on parallel machines. (Extended abstract)

Cites work

• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• Note on scheduling intervals on-line

Cited in

(9)

• A note on the online interval scheduling secretary problem
• Online interval scheduling: Randomized and multiprocessor cases
• Note on scheduling intervals on-line
• Visiting infinitely often the unit interval while minimizing the idle time of high priority segments
• An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling
• LP rounding and combinatorial algorithms for minimizing active and busy time
• Competitive on-line scheduling of continuous-media streams
• Randomized algorithms for on-line scheduling problems: How low can't you go?
• Optimal online buffer scheduling for block devices

This page was built for publication: Randomized online algorithms for maximizing busy time interval scheduling

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