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

DOI10.1137/S0097539793258775zbMATH Open0885.90054OpenAlexW4236539243MaRDI QIDQ4337646FDOQ4337646

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

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 problemson-line algorithmsworst-case bounds

Mathematics Subject Classification ID

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

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337646)