Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes
From MaRDI portal
Publication:3455876
DOI10.1142/S0217595915500323zbMath1330.90033MaRDI QIDQ3455876
Publication date: 11 December 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- A note on hierarchical scheduling on two uniform machines
- Optimal preemptive semi-online scheduling on two uniform processors
- 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
- Semi on-line scheduling on two identical machines
- Preemptive on-line scheduling for two uniform processors
- On-line algorithms for the channel assignment problem in cellular networks.
- Parallel machine scheduling under a grade of service provision
- Online scheduling on uniform machines with two hierarchies
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- On-Line Load Balancing in a Hierarchical Server Topology
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Randomized on-line scheduling on two uniform machines
This page was built for publication: Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes
