Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

DOI10.1007/978-3-319-07557-0_21zbMath1415.90040OpenAlexW2769189507MaRDI QIDQ5419000

Jannik Matuschke, José R. Correa, Víctor Verdugo, José Verschae, Ola Svensson, Alberto Marchetti-Spaccamela, Leen Stougie

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/23275

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Non-preemptive Scheduling on Machines with Setup Times ⋮ Approximate algorithms for unrelated machine scheduling to minimize makespan

This page was built for publication: Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines