Improved algorithm for a generalized on-line scheduling problem on identical machines
From MaRDI portal
Publication:2432940
DOI10.1016/j.ejor.2005.06.061zbMath1137.90502OpenAlexW1974078419MaRDI QIDQ2432940
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.061
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines ⋮ Online scheduling of malleable parallel jobs with setup times on two identical machines
Cites Work
- New algorithms for an ancient scheduling problem.
- On-line scheduling revisited
- On-line scheduling for jobs with arbitrary release times
- 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
- Bounds on Multiprocessing Timing Anomalies