Corrigendum: ``Improved results for data migration and open shop scheduling

DOI10.1145/2500123MaRDI QIDQ5891963zbMATH OpenOpenAlexFDO

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

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

approximation algorithmsdata migrationlinear programmingLP roundingopen shop scheduling

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)

Recommendations

• Improved results for data migration and open shop scheduling
• Automata, Languages and Programming
• Approximation algorithms for shop scheduling problems with minsum objective: A correction
• Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming

Cited in

(5)

• Combinatorial algorithms for data migration to minimize average completion time
• Improved results for data migration and open shop scheduling
• Automata, Languages and Programming
• Polytope scheduling with groups: unified models and optimal guarantees
• Approximation algorithms for shop scheduling problems with minsum objective: A correction

This page was built for publication: Corrigendum: ``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 Q5891963)