Tighter Approximation Bounds for LPT Scheduling in Two Special Cases

DOI10.1007/11758471_20zbMath1183.90176OpenAlexW1523889222MaRDI QIDQ3434556

Annamária Kovács

Publication date: 2 May 2007

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

Full work available at URL: https://doi.org/10.1007/11758471_20

Mathematics Subject Classification ID

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

Related Items (3)

On designing truthful mechanisms for online scheduling ⋮ Related machine scheduling with machine speeds satisfying linear constraints ⋮ The Price of Anarchy on Uniformly Related Machines Revisited

This page was built for publication: Tighter Approximation Bounds for LPT Scheduling in Two Special Cases