LP-Based Online Scheduling: From Single to Parallel Machines
From MaRDI portal
Publication:3596362
DOI10.1007/11496915_15zbMath1119.90314OpenAlexW1501070407MaRDI QIDQ3596362
José R. Correa, Michael R. Wagner
Publication date: 30 August 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/127845
Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Randomized algorithms (68W20)
Related Items (6)
Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time ⋮ Online \(k\)-server routing problems ⋮ Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ Almost sure asymptotic optimality for online routing and machine scheduling problems ⋮ On-line scheduling of parallel machines to minimize total completion times ⋮ Stochastic Online Scheduling Revisited
This page was built for publication: LP-Based Online Scheduling: From Single to Parallel Machines
