Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
From MaRDI portal
Publication:499334
DOI10.1016/J.DAM.2015.05.005zbMATH Open1330.90041OpenAlexW889629991MaRDI QIDQ499334FDOQ499334
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 30 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.005
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
- Scheduling
- Scheduling algorithms
- Scheduling with deadlines and loss functions
- NP-complete scheduling problems
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
- Title not available (Why is that?)
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
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)
