Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
From MaRDI portal
Publication:4911539
DOI10.1007/978-3-642-36694-9_33zbMath1377.90034OpenAlexW1960237771MaRDI QIDQ4911539
M. I. Sviridenko, Andreas Wiese
Publication date: 19 March 2013
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_33
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items (4)
Strong LP formulations for scheduling splittable jobs on unrelated machines ⋮ Scheduling and fixed-parameter tractability ⋮ How unsplittable-flow-covering helps scheduling with job-dependent cost functions ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
This page was built for publication: Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
