Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
From MaRDI portal
Publication:3602829
DOI10.1007/978-3-540-93980-1_5zbMATH Open1209.68660OpenAlexW1526632872MaRDI QIDQ3602829FDOQ3602829
Chung Keung Poon, Stanley P. Y. Fung, Feifeng Zheng
Publication date: 12 February 2009
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_5
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- On the competitiveness of on-line real-time task scheduling
- Randomized online interval scheduling
- On-line scheduling of jobs with fixed start and end times
- Title not available (Why is that?)
- Bounding the Power of Preemption in Randomized Scheduling
- Improved Randomized Results for That Interval Selection Problem
- Improved On-Line Broadcast Scheduling with Deadlines
- Online Interval Scheduling: Randomized and Multiprocessor Cases
- Online scheduling with partial job values: does timesharing or randomization help?
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
- An improved randomized on-line algorithm for a weighted interval selection problem
- Title not available (Why is that?)
- A Near Optimal Scheduler for On-Demand Data Broadcasts
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- On randomized online scheduling
- Scheduling broadcasts with deadlines
Cited In (11)
- Online scheduling of jobs with fixed start times on related machines
- On-line scheduling of equal-length intervals on parallel machines
- Improved randomized results for the interval selection problem
- Improved competitive algorithms for online scheduling with partial job values
- Competitive algorithms for multistage online scheduling
- ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
- Improved randomized online scheduling of intervals and jobs
- Improved upper bounds for online malleable job scheduling
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- Online interval scheduling with a bounded number of failures
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
Recommendations
- Improved randomized online scheduling of intervals and jobs 👍 👎
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help 👍 👎
- Online Interval Scheduling: Randomized and Multiprocessor Cases 👍 👎
- Online interval scheduling: Randomized and multiprocessor cases 👍 👎
- Automata, Languages and Programming 👍 👎
This page was built for publication: Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602829)
