Minimizing total completion time on uniform machines with deadline constraints

DOI10.1145/1125994.1126000zbMATH Open1321.90055OpenAlexW2077533566MaRDI QIDQ2944508FDOQ2944508

Authors: Joseph Y.-T. Leung, Teofilo F. Gonzalez, Michael L. Pinedo 

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1125994.1126000

Recommendations

• Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
• Preemptive scheduling of two uniform parallel machines to minimize total tardiness
• Preemptive scheduling on identical parallel machines subject to deadlines.
• Preemptive scheduling on uniform machines to minimize mean flow time
• Preemptive scheduling with deadlines on parallel machines

zbMATH Keywords

polynomial-time algorithmsmean flow timeuniform machinesdeadline constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
• Preemptive scheduling of two uniform parallel machines to minimize total tardiness
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Total completion time minimization scheduling on two hierarchical uniform machines

This page was built for publication: Minimizing total completion time on uniform machines with deadline constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944508)