List's worst-average-case or WAC ratio
From MaRDI portal
Publication:835596
DOI10.1007/s10951-007-0019-7zbMath1168.90463MaRDI QIDQ835596
Eric Torng, Christopher J. Osborn
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0019-7
90B35: Deterministic scheduling theory in operations research
Related Items
Machine covering in the random-order model, Relative Worst-Order Analysis: A Survey, Scheduling In the random-order model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New algorithms for an ancient scheduling problem.
- A better lower bound for on-line scheduling
- On-line scheduling revisited
- New lower and upper bounds for on-line scheduling
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- A Better Algorithm for an Ancient Scheduling Problem
- Bounds for Certain Multiprocessing Anomalies