Minimizing total completion time on uniform machines with deadline constraints
From MaRDI portal
Publication:2944508
DOI10.1145/1125994.1126000zbMath1321.90055OpenAlexW2077533566MaRDI QIDQ2944508
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
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)
Related Items
This page was built for publication: Minimizing total completion time on uniform machines with deadline constraints