Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

DOI10.1137/1.9781611975994.170OpenAlexW2999324685MaRDI QIDQ5146966

Sungjin Im, Maryam Shadloo

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.05015

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines ⋮ Contention resolution, matrix scaling and fair allocation

This page was built for publication: Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution