A general framework for handling commitment in online throughput maximization
From MaRDI portal
Publication:5918914
DOI10.1007/s10107-020-01469-2zbMath1446.90075OpenAlexW3023732341MaRDI QIDQ5918914
Lin Chen, Kevin Schewior, Franziska Eberle, Clifford Stein, Nicole Megow
Publication date: 28 August 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01469-2
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
A competitive algorithm for throughput maximization on identical machines ⋮ Fixed interval scheduling with third‐party machines ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization
Uses Software
Cites Work
- On the competitiveness of on-line real-time task scheduling
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
- On-line scheduling of jobs with fixed start and end times
- Scheduling parallelizable jobs online to maximize throughput
- How to Schedule When You Have to Buy Your Energy
- Bounding the Power of Preemption in Randomized Scheduling
- Optimal multiplexing on a single link: delay and buffer requirements
- An ℴ(log m)-Competitive Algorithm for Online Machine Minimization
- The Power of Migration for Online Slack Scheduling.
- Maximizing job completions online
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- Competitive Algorithms for Due Date Scheduling
- A general framework for handling commitment in online throughput maximization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A general framework for handling commitment in online throughput maximization
