Preemptive scheduling with deadlines on parallel machines
From MaRDI portal
Recommendations
- Preemptive scheduling with deadlines on a single machine
- Preemptive scheduling on identical parallel machines subject to deadlines.
- Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
- scientific article; zbMATH DE number 3883931
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
Cited in
(26)- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Preemptive multiprocessor task scheduling with release times and time windows
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Parallel machine batching and scheduling with deadlines
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- Preemptive scheduling on identical parallel machines subject to deadlines.
- Integer preemptive scheduling on parallel machines
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- Minimizing total completion time on uniform machines with deadline constraints
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- Preemptive Scheduling of Hybrid Parallel Machines
- Minimizing Job Idleness in Deadline Constrained Environments
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
- scientific article; zbMATH DE number 2086672 (Why is no real title available?)
- Preemptive scheduling with deadlines on a single machine
- Algorithms – ESA 2005
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem
- Preemptive multiprocessor scheduling with rejection
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
- Preemptive scheduling on a small number of hierarchical machines
- Jackson's semi-preemptive scheduling on a single machine
This page was built for publication: Preemptive scheduling with deadlines on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917044)
