A tight lower bound for the best-\(\alpha\) algorithm

DOI10.1016/S0020-0190(99)00082-4zbMath1017.90042OpenAlexW1997128661MaRDI QIDQ1606957

Patchrawat Uthaisombut, Eric Torng

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00082-4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (1)

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

This page was built for publication: A tight lower bound for the best-\(\alpha\) algorithm