Optimally Handling Commitment Issues in Online Throughput Maximization
From MaRDI portal
Publication:5874511
DOI10.4230/LIPIcs.ESA.2020.41OpenAlexW3081701422MaRDI QIDQ5874511
Kevin Schewior, Nicole Megow, Franziska Eberle
Publication date: 7 February 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2020.41
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Eliminating Migration in Multi-processor Scheduling
- How to Schedule When You Have to Buy Your Energy
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounding the Power of Preemption in Randomized Scheduling
- Speed is as powerful as clairvoyance
- An $\mathcal{O}(\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
This page was built for publication: Optimally Handling Commitment Issues in Online Throughput Maximization
