Total completion time minimization scheduling on two hierarchical uniform machines
From MaRDI portal
Publication:1676324
DOI10.1016/j.tcs.2017.08.016zbMath1380.90134OpenAlexW2751218813MaRDI QIDQ1676324
Yiwei Jiang, Min Ji, Hao Zhou, Ping Zhou, Yun Zhao
Publication date: 6 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.08.016
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- A note on hierarchical scheduling on two uniform machines
- Online hierarchical scheduling: an approach using mathematical programming
- Online and semi-online hierarchical scheduling for load balancing on uniform machines
- Online parallel machines scheduling with two hierarchies
- Online and semi-online scheduling of two machines under a grade of service provision
- Preemptive scheduling on a small number of hierarchical machines
- The hierarchical model for load balancing on two machines
- Online scheduling on parallel machines with two goS levels
- On-line algorithms for the channel assignment problem in cellular networks.
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- Online scheduling on uniform machines with two hierarchies
- Total completion time minimization in online hierarchical scheduling of unit-size jobs
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-Line Load Balancing in a Hierarchical Server Topology
This page was built for publication: Total completion time minimization scheduling on two hierarchical uniform machines
