Semi-online hierarchical load balancing problem with bounded processing times
From MaRDI portal
Publication:897964
DOI10.1016/J.TCS.2015.03.050zbMATH Open1333.90049OpenAlexW2092873069MaRDI QIDQ897964FDOQ897964
Authors: Taibo Luo, Yinfeng 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
Recommendations
- Semi-online hierarchical load balancing problem with bounded processing times
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Online and semi-online scheduling of two machines under a grade of service provision
- Parallel machine scheduling under a grade of service provision
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Semi-online scheduling with two GoS levels and unit processing time
- The hierarchical model for load balancing on two machines
- Online and semi-online hierarchical scheduling for load balancing on uniform machines
- Optimal algorithms for semi-online machine covering on two hierarchical machines
Cited In (10)
- Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- The hierarchical model for load balancing on two machines
- Bin stretching with migration on two hierarchical machines
- Semi-online multiprocessor scheduling with bounded jobs
- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Semi-online scheduling: a survey
- Online early work maximization problem on two hierarchical machines with buffer or rearrangements
- Online scheduling with migration on two hierarchical machines
This page was built for publication: Semi-online hierarchical load balancing problem with bounded processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897964)
