Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling

DOI10.1007/978-3-642-40450-4_64zbMath1395.90150OpenAlexW435588996MaRDI QIDQ2849363

Kim Thang Nguyen

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_64

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (9)

An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ Unnamed Item ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Continuous speed scaling with variability: a simple and direct approach ⋮ Welfare maximization with production costs: a primal dual approach ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ An improved approximation algorithm for scheduling under arborescence precedence constraints ⋮ Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems

This page was built for publication: Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling