Randomized online algorithms for maximizing busy time interval scheduling

DOI10.1007/BF02309339zbMath0841.68014MaRDI QIDQ1909593

R. Garbe, Ulrich Faigle, 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)

Related Items

LP rounding and combinatorial algorithms for minimizing active and busy time, Note on scheduling intervals on-line, Competitive on-line scheduling of continuous-media streams

Cites Work

• Note on scheduling intervals on-line
• Unnamed Item