Lower bounds on online deadline scheduling with preemption penalties

DOI10.1016/J.IPL.2008.05.020zbMATH Open1191.68098OpenAlexW2058359717MaRDI QIDQ975450FDOQ975450

Authors: Stanley P. Y. Fung 

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.020

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.

zbMATH Keywords

schedulingon-line algorithmspreemption penalties

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• On the competitiveness of on-line real-time task scheduling
• 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
• Minimizing total completion time subject to job release dates and preemption penalties
• On-line production order scheduling with preemption penalties
• Improved On-Line Broadcast Scheduling with Deadlines
• A Near Optimal Scheduler for On-Demand Data Broadcasts
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Algorithmic Applications in Management

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)