A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
From MaRDI portal
(Redirected from Publication:834188)
Recommendations
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Preemptive scheduling algorithms with nested processing set restriction
- Fast approximation algorithms for job scheduling with processing set restrictions
- scientific article; zbMATH DE number 2080263
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
Cites work
- A new approach to the maximum-flow problem
- Complexity of scheduling problems with multi-purpose machines
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Parallel machine scheduling under a grade of service provision
- Parallel machine scheduling with job assignment restrictions
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Scheduling with deadlines and loss functions
Cited in
(4)
This page was built for publication: A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834188)