A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"

DOI10.1137/S0097539793258775zbMath0885.90054OpenAlexW4236539243MaRDI QIDQ4337646

P. R. Narayanan, R. Chandrasekaran, Bo Chen, André van Vliet, Gábor Galambos

Publication date: 26 May 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793258775

zbMATH Keywords

schedulingcombinatorial problemsworst-case boundson-line algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (3)

A survey on makespan minimization in semi-online environments ⋮ Scheduling web advertisements: a note on the minspace problem ⋮ On-line scheduling revisited

This page was built for publication: A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"