Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness

DOI10.1016/j.dam.2015.05.005zbMath1330.90041OpenAlexW889629991MaRDI QIDQ499334

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

zbMATH Keywords

schedulingparallel machinesprecedence constraintsmaximum latenessinteger preemptions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• NP-complete scheduling problems
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• Scheduling with Deadlines and Loss Functions
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
• Scheduling

This page was built for publication: Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness