Online Interval Scheduling: Randomized and Multiprocessor Cases
DOI10.1007/978-3-540-73545-8_19zbMATH Open1206.68379OpenAlexW2143393151MaRDI QIDQ3608843FDOQ3608843
Authors: Chung Keung Poon, Feifeng Zheng, Stanley P. Y. Fung 
Publication date: 6 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2381/3830
Recommendations
Randomized algorithms (68W20) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (17)
- Competitive Algorithms for Cottage Rental
- New algorithms for online rectangle filling with \(k\)-lookahead
- Title not available (Why is that?)
- Online scheduling of equal-processing-time task systems
- Online interval scheduling: Randomized and multiprocessor cases
- Improved Randomized Results for That Interval Selection Problem
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- An improved randomized on-line algorithm for a weighted interval selection problem
- Models and Algorithms for Stochastic Online Scheduling
- Computing and Combinatorics
- Online interval scheduling on a single machine with finite lookahead
- Comparing deterministic, robust and online scheduling using entropy
- Dynamic algorithms for monotonic interval scheduling problem
- A note on the online interval scheduling secretary problem
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
- Online selection of intervals and \(t\)-intervals
- Online scheduling with partial job values: does timesharing or randomization help?
This page was built for publication: Online Interval Scheduling: Randomized and Multiprocessor Cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608843)
