Preemptive semi-online algorithms for parallel machine scheduling with known total size
From MaRDI portal
Publication:2508575
DOI10.1007/s10114-005-0686-2zbMath1130.90327MaRDI QIDQ2508575
Yong He, Hao Zhou, Yiwei Jiang
Publication date: 13 October 2006
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-005-0686-2
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
Linear time algorithms for parallel machine scheduling, Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
Cites Work
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Semi on-line algorithms for the partition problem
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
- Preemptive machine covering on parallel machines
- Scheduling with Deadlines and Loss Functions
- Semi-on-line scheduling problems for maximizing the minimum machine completion time
- Unnamed Item
- Unnamed Item
- Unnamed Item