Randomized online algorithms for maximizing busy time interval scheduling
From MaRDI portal
Publication:1909593
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
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)