Improved results for data migration and open shop scheduling

DOI10.1145/1125994.1126001MaRDI QIDQ2944509zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmsdata migrationlinear programmingLP roundingopen shopscheduling

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
• Combinatorial algorithms for data migration to minimize average completion time
• Algorithms for data migration
• Corrigendum: ``Improved results for data migration and open shop scheduling

Cited in

(7)

• Combinatorial algorithms for data migration to minimize average completion time
• Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
• Data migration to minimize the total completion time
• On a local protocol for concurrent file transfers
• Automata, Languages and Programming
• Corrigendum: ``Improved results for data migration and open shop scheduling
• Minimal cost reconfiguration of data placement in a storage area network

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

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