Data migration to minimize the total completion time

DOI10.1016/j.jalgor.2004.07.009zbMath1066.90032OpenAlexW2013639761MaRDI QIDQ4675488

Yoo-Ah Kim

Publication date: 4 May 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.07.009

zbMATH Keywords

Linear programmingSchedulingApproximation algorithmsData migration

Mathematics Subject Classification ID

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

Related Items (5)

Algorithms for data migration ⋮ Min Sum Edge Coloring in Multigraphs Via Configuration LP ⋮ On a local protocol for concurrent file transfers ⋮ Facility location models to locate data in information networks: a literature review ⋮ Combinatorial algorithms for data migration to minimize average completion time

This page was built for publication: Data migration to minimize the total completion time