Lower bounds on online deadline scheduling with preemption penalties
From MaRDI portal
(Redirected from Publication:975450)
Recommendations
- Online scheduling with preemption or non-completion penalties
- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
- On Job Scheduling with Preemption Penalties
- On-line production order scheduling with preemption penalties
- Lower bounds for on-line single-machine scheduling.
Cites work
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- A Near Optimal Scheduler for On-Demand Data Broadcasts
- Algorithmic Applications in Management
- Improved On-Line Broadcast Scheduling with Deadlines
- Minimizing total completion time subject to job release dates and preemption penalties
- On the competitiveness of on-line real-time task scheduling
- On-line production order scheduling with preemption penalties
- On-line scheduling of jobs with fixed start and end times
- On-line scheduling on a single machine: Maximizing the number of early jobs
- Scheduling with job release dates, delivery times and preemption penalties
Cited in
(6)- On-line production order scheduling with preemption penalties
- Online production planning to maximize the number of on-time orders
- Online and offline scheduling with cache-related preemption delays
- Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting
- Online scheduling with preemption or non-completion penalties
- On Job Scheduling with Preemption Penalties
This page was built for publication: Lower bounds on online deadline scheduling with preemption penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975450)
