Semi-online hierarchical load balancing problem with bounded processing times

DOI10.1016/j.tcs.2015.03.050zbMath1333.90049OpenAlexW2092873069MaRDI QIDQ897964

Taibo Luo, Yin-Feng Xu

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.050

zbMATH Keywords

schedulingcompetitive ratioload balancinghierarchysemi-online

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items

Semi-online scheduling: a survey, Bin stretching with migration on two hierarchical machines, Online early work maximization problem on two hierarchical machines with buffer or rearrangements, Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs, Online scheduling with migration on two hierarchical machines

Cites Work

• Semi-online scheduling with two GoS levels and unit processing time
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• Online and semi-online hierarchical scheduling for load balancing on uniform machines
• Online and semi-online scheduling of two machines under a grade of service provision
• The hierarchical model for load balancing on two machines
• Parallel machine scheduling under a grade of service provision
• Optimal algorithms for semi-online machine covering on two hierarchical machines
• Optimal online algorithms for scheduling on two identical machines under a grade of service