Combinatorial algorithms for data migration to minimize average completion time

DOI10.1007/S00453-007-9118-2MaRDI QIDQ1024212zbMATHOpenAlexFDO

Authors Rajiv Gandhi, Julián Mestre

Publication date 16 June 2009

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9118-2

zbMATH Keywords

approximation algorithmprimal-dual algorithmopen shop problemmin-sum scheduling problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
• Automata, Languages and Programming
• Improved results for data migration and open shop scheduling
• Corrigendum: ``Improved results for data migration and open shop scheduling
• Data migration to minimize the total completion time
• On algorithms for efficient data migration
• Algorithms for data migration
• scientific article; zbMATH DE number 1848399
• Improved Algorithms for Data Migration
• Improved approximation algorithms for data migration

Cites work

• scientific article; zbMATH DE number 1187164 (Why is no real title available?)
• scientific article; zbMATH DE number 1848399 (Why is no real title available?)
• scientific article; zbMATH DE number 2102785 (Why is no real title available?)
• A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
• Adaptive local ratio
• Algorithms for Data Migration with Cloning
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Approximation algorithms for shop scheduling problems with minsum objective
• Approximation and Online Algorithms
• Bounds for Certain Multiprocessing Anomalies
• Complexity results for minimum sum edge coloring
• Data migration to minimize the total completion time
• Improved Algorithms for Data Migration
• Improved results for data migration and open shop scheduling
• On algorithms for efficient data migration
• On chromatic sums and distributed resource allocation
• On the $1.1$ Edge-Coloring of Multigraphs
• Scheduling File Transfers
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Structure of a simple scheduling polyhedron
• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs

Cited in

(9)

• Minimum sum set coloring of trees and line graphs of trees
• Scheduling problems over a network of machines
• Improved Algorithms for Data Migration
• Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
• Scheduling problems over network of machines
• Improved approximation algorithms for data migration
• Data migration to minimize the total completion time
• Security-aware database migration planning
• On a local protocol for concurrent file transfers

This page was built for publication: Combinatorial algorithms for data migration to minimize average completion time

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