Preemptive multiprocessor task scheduling with release times and time windows
From MaRDI portal
(Redirected from Publication:1374419)
Recommendations
- Preemptive Scheduling of Parallel Jobs on Multiprocessors
- scientific article; zbMATH DE number 871911
- scientific article; zbMATH DE number 1487943
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Preemptive scheduling with deadlines on parallel machines
- Preemptive scheduling of periodic jobs in uniform multiprocessor systems
- Scheduling preemptable tasks on parallel processors with limited availability
Cited in
(9)- Scheduling multiprocessor tasks -- An overview
- Scheduling preemptable tasks on parallel processors with limited availability
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- A polynomial algorithm for some preemptive multiprocessor task scheduling problems
- Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
- Scheduling multiprocessor tasks on two parallel processors
- Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors
- scientific article; zbMATH DE number 1487943 (Why is no real title available?)
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
This page was built for publication: Preemptive multiprocessor task scheduling with release times and time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374419)