On-line scheduling on parallel machines to minimize the makespan
From MaRDI portal
Publication:328085
DOI10.1007/s11424-015-3252-8zbMath1351.90098OpenAlexW768960016MaRDI QIDQ328085
Publication date: 20 October 2016
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-015-3252-8
Related Items (2)
Online scheduling on two parallel identical machines under a grade of service provision ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels
Cites Work
- Scheduling on identical machines: How good is LPT in an on-line setting?
- On-line scheduling for jobs with arbitrary release times
- Scheduling Parallel Machines On-Line
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Randomized on-line scheduling on two uniform machines
- An optimal online algorithm for scheduling two machines with release times
This page was built for publication: On-line scheduling on parallel machines to minimize the makespan