A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
From MaRDI portal
Publication:4606320
DOI10.4230/LIPIcs.ESA.2016.49zbMath1397.90177arXiv1507.07396OpenAlexW2242342996MaRDI QIDQ4606320
Chien-Chung Huang, Sebastian Ott
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1507.07396
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
Makespan minimization on unrelated parallel machines with a few bags, Approximation algorithms for the graph balancing problem with two speeds and two job lengths, Structural parameters for scheduling with assignment restrictions, Structured Instances of Restricted Assignment with Two Processing Times, Unnamed Item, Unnamed Item, Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments