Scheduling preemptable tasks on parallel processors with limited availability
From MaRDI portal
Recommendations
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- scientific article; zbMATH DE number 2080263
- Scheduling on semi-identical processors
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Preemptive multiprocessor task scheduling with release times and time windows
Cited in
(25)- Preemptive scheduling with staircase and piecewise linear resource availability
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- Routing equal-size messages on a slotted ring
- Minimizing maximum tardiness in single FMS machine scheduling with tool changes
- Multiprocessor scheduling with availability constraints
- Scheduling on semi-identical processors
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Approximation schemes for parallel machine scheduling with availability constraints
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Parallel machine scheduling with machine availability and eligibility constraints
- Preemptive multiprocessor task scheduling with release times and time windows
- New applications of the Muntz and Coffman algorithm
- A survey of due-date related single-machine with two-agent scheduling problem
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Complexity of Scheduling Parallel Task Systems
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Scheduling jobs in open shops with limited machine availability
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- On a scheduling problem where a job can be executed only by a limited number of processors
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
- Online scheduling on semi-related machines
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
This page was built for publication: Scheduling preemptable tasks on parallel processors with limited availability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575603)
