The 2-valued case of makespan minimization with assignment constraints

DOI10.1016/j.ipl.2012.09.004zbMath1259.68238arXiv1212.1609OpenAlexW2073449782MaRDI QIDQ1941692

Yannis Moysoglou, Stavros G. Kolliopoulos

Publication date: 21 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

schedulingmakespan minimizationapproximation algorithmsgraph balancing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (7)

On some special cases of the restricted assignment problem ⋮ Integrality gaps for strengthened linear relaxations of capacitated facility location ⋮ Makespan minimization on unrelated parallel machines with a few bags ⋮ Approximation algorithms for the graph balancing problem with two speeds and two job lengths ⋮ A 3/2-approximation algorithm for the graph balancing problem with two weights ⋮ Estimating the makespan of the two-valued restricted assignment problem ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs

This page was built for publication: The 2-valued case of makespan minimization with assignment constraints