On the Configuration-LP for Scheduling on Unrelated Machines

DOI10.1007/978-3-642-23719-5_45zbMath1348.90317arXiv1011.4957OpenAlexW2570889430MaRDI QIDQ3092258

Andreas Wiese, José Verschae

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (7)

On some special cases of the restricted assignment problem ⋮ On the configuration LP for maximum budgeted allocation ⋮ Graph balancing: a special case of scheduling unrelated parallel machines ⋮ On the configuration-LP for scheduling on unrelated machines ⋮ Estimating the makespan of the two-valued restricted assignment problem ⋮ Partitioned EDF scheduling on a few types of unrelated multiprocessors ⋮ Integrality gap analysis for bin packing games

This page was built for publication: On the Configuration-LP for Scheduling on Unrelated Machines