Online scheduling with preemption or non-completion penalties
From MaRDI portal
Publication:398912
DOI10.1007/s10951-013-0321-5zbMath1297.90042OpenAlexW2080390633MaRDI QIDQ398912
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0321-5
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Approximation issues of fractional knapsack with penalties: a note ⋮ An analysis of the non-preemptive mixed-criticality match-up scheduling problem ⋮ A flexible job shop scheduling approach with operators for coal export terminals -- a mature approach ⋮ Online Submodular Maximization with Preemption ⋮ Online Submodular Maximization Problem with Vector Packing Constraint.
Cites Work
- Improved on-line broadcast scheduling with deadlines
- Lower bounds on online deadline scheduling with preemption penalties
- On the competitiveness of on-line real-time task scheduling
- On-line scheduling of jobs with fixed start and end times
- Admission control with immediate notification
- Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
- A Near Optimal Scheduler for On-Demand Data Broadcasts
- Online Scheduling of Equal-Length Jobs on Parallel Machines
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
- On Job Scheduling with Preemption Penalties
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- Online Scheduling with Hard Deadlines on Parallel Machines
- Algorithmic Applications in Management
- On-line scheduling on a single machine: Maximizing the number of early jobs
This page was built for publication: Online scheduling with preemption or non-completion penalties
