Online scheduling with preemption or non-completion penalties
From MaRDI portal
Publication:398912
DOI10.1007/S10951-013-0321-5zbMATH Open1297.90042OpenAlexW2080390633MaRDI QIDQ398912FDOQ398912
Authors: Stanley P. Y. Fung 
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
Recommendations
- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
- Lower bounds on online deadline scheduling with preemption penalties
- On Job Scheduling with Preemption Penalties
- Preemptive Weighted Completion Time Scheduling of Parallel Jobs
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
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
- Lower bounds on online deadline scheduling with preemption penalties
- 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
- Improved on-line broadcast scheduling with deadlines
Cited In (15)
- On-line production order scheduling with preemption penalties
- On-line scheduling with tight deadlines.
- Scheduling for flow-time with admission control
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Approximation issues of fractional knapsack with penalties: a note
- Online scheduling with reassignment
- A flexible job shop scheduling approach with operators for coal export terminals -- a mature approach
- An analysis of the non-preemptive mixed-criticality match-up scheduling problem
- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
- Lower bounds on online deadline scheduling with preemption penalties
- On Job Scheduling with Preemption Penalties
- Minimizing total completion time subject to job release dates and preemption penalties
- Online submodular maximization with preemption
- Aggressive online deadline scheduling
- Maximizing job completions online
This page was built for publication: Online scheduling with preemption or non-completion penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398912)
