Randomized online algorithms for maximizing busy time interval scheduling

DOI10.1007/BF02309339zbMATH Open0841.68014MaRDI QIDQ1909593FDOQ1909593

Authors: U. Faigle, R. Garbe, Walter Kern 

Publication date: 17 March 1996

Published in: Computing (Search for Journal in Brave)

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)

zbMATH Keywords

busy timeprobabilistic online algorithm

Mathematics Subject Classification ID

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

Cites Work

• Note on scheduling intervals on-line
• Title not available (Why is that?)

Cited In (9)

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

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)