Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
From MaRDI portal
(Redirected from Publication:499334)
Recommendations
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Integer preemptive scheduling on parallel machines
- scientific article; zbMATH DE number 3883931
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Minimizing total tardiness on parallel machines with preemptions
Cites work
- scientific article; zbMATH DE number 3780551 (Why is no real title available?)
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
- NP-complete scheduling problems
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Scheduling
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Scheduling algorithms
- Scheduling with deadlines and loss functions
Cited in
(5)- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Integer preemptive scheduling on parallel machines
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
This page was built for publication: Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499334)
