Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
From MaRDI portal
Publication:5169463
DOI10.1080/02331934.2014.895902zbMath1311.90050OpenAlexW2028445684MaRDI QIDQ5169463
Rongheng Li, Yunxia Zhou, Xiayan Cheng
Publication date: 10 July 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.895902
Related Items
Cites Work
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- List scheduling for jobs with arbitrary release times and similar lengths
- New algorithms for an ancient scheduling problem.
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- On-line scheduling revisited
- On-line scheduling for jobs with arbitrary release times
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online algorithms for parallel machine scheduling problems
- New lower and upper bounds for on-line scheduling
- Ordinal algorithms for parallel machine scheduling
- Improved algorithm for a generalized on-line scheduling problem on identical machines
- A Note on Online Scheduling for Jobs with Arbitrary Release Times
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- Bounds on Multiprocessing Timing Anomalies
