Corrigendum

DOI10.1145/2500123zbMath1301.68072OpenAlexW1993025312MaRDI QIDQ5891963

Hadas Shachnai, Guy Kortsarz, Rajiv Gandhi, Magnús M. Halldórsson

Publication date: 5 December 2014

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

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

zbMATH Keywords

linear programmingapproximation algorithmsopen shop schedulingLP roundingdata migration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

Combinatorial algorithms for data migration to minimize average completion time

This page was built for publication: Corrigendum