Optimally Handling Commitment Issues in Online Throughput Maximization
From MaRDI portal
Recommendations
- A general framework for handling commitment in online throughput maximization
- A general framework for handling commitment in online throughput maximization
- Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
- Optimal online contention resolution schemes via ex-ante prophet inequalities
- Optimizing throughput and energy in online deadline scheduling
- Algorithm Theory - SWAT 2004
- Online scheduling of bounded length jobs to maximize throughput
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- An optimal online algorithm for packet scheduling with agreeable deadlines
- Optimal Online Algorithms for Minimax Resource Scheduling
Cites work
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- A general framework for handling commitment in online throughput maximization
- An O( m)-competitive algorithm for online machine minimization
- Bounding the Power of Preemption in Randomized Scheduling
- Competitive Algorithms for Due Date Scheduling
- Eliminating migration in multi-processor scheduling
- How to schedule when you have to buy your energy
- scientific article; zbMATH DE number 1670533 (Why is no real title available?)
- scientific article; zbMATH DE number 1003261 (Why is no real title available?)
- scientific article; zbMATH DE number 1305429 (Why is no real title available?)
- Maximizing job completions online
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
- On the competitiveness of on-line real-time task scheduling
- On-line scheduling of jobs with fixed start and end times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling parallelizable jobs online to maximize throughput
- Speed is as powerful as clairvoyance
- The power of migration for online slack scheduling
Cited in
(4)
This page was built for publication: Optimally Handling Commitment Issues in Online Throughput Maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874511)
