On Job Scheduling with Preemption Penalties
From MaRDI portal
Recommendations
- Online scheduling with preemption or non-completion penalties
- On-line production order scheduling with preemption penalties
- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
- Lower bounds on online deadline scheduling with preemption penalties
- On the Value of Preemption in Scheduling
Cites work
- A near optimal scheduler for on-demand data broadcasts
- Handbook of applied optimization
- scientific article; zbMATH DE number 1003261 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Improved On-Line Broadcast Scheduling with Deadlines
- Lower bounds on online deadline scheduling with preemption penalties
- On-line production order scheduling with preemption penalties
- Patience is a virtue: the effect of slack on competitiveness for admission control
- Scheduling broadcasts with deadlines
- Theoretical Computer Science
Cited in
(6)- Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints
- On-line production order scheduling with preemption penalties
- Scheduling non-preemptible jobs to minimize peak demand
- scientific article; zbMATH DE number 5969127 (Why is no real title available?)
- Online scheduling with preemption or non-completion penalties
- Lower bounds on online deadline scheduling with preemption penalties
This page was built for publication: On Job Scheduling with Preemption Penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638458)