Minimum Makespan Scheduling with Low Rank Processing Times

DOI10.1137/1.9781611973105.67zbMath1421.68197OpenAlexW4241194305MaRDI QIDQ5741775

Udi Wieder, Kunal Talwar, Ravishankar Krishnaswamy, Aditya Bhaskara

Publication date: 15 May 2019

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

Full work available at URL: https://doi.org/10.1137/1.9781611973105.67

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (4)

On the optimality of exact and approximation algorithms for scheduling problems ⋮ Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines ⋮ An improved lower bound for rank four scheduling ⋮ A PTAS for Scheduling Unrelated Machines of Few Different Types

This page was built for publication: Minimum Makespan Scheduling with Low Rank Processing Times