Improved results for data migration and open shop scheduling

DOI10.1145/1125994.1126001zbMath1321.68119OpenAlexW2014528617MaRDI QIDQ2944509

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

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.1126001

zbMATH Keywords

linear programmingschedulingopen shopapproximation algorithmsLP roundingdata migration

Mathematics Subject Classification ID

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

Related Items (3)

On a local protocol for concurrent file transfers ⋮ Minimal cost reconfiguration of data placement in a storage area network ⋮ Combinatorial algorithms for data migration to minimize average completion time

This page was built for publication: Improved results for data migration and open shop scheduling