Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
From MaRDI portal
Publication:4631681
DOI10.1142/S0217595919500027zbMath1412.90056OpenAlexW2899642334WikidataQ128981433 ScholiaQ128981433MaRDI QIDQ4631681
Publication date: 18 April 2019
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595919500027
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (3)
Semi-online scheduling: a survey ⋮ Bin stretching with migration on two hierarchical machines ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection
Cites Work
- Unnamed Item
- Unnamed Item
- Semi-online scheduling with two GoS levels and unit processing time
- Online hierarchical scheduling: an approach using mathematical programming
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Improved bounds for online scheduling with eligibility constraints
- Online and semi-online scheduling of two machines under a grade of service provision
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-Line Load Balancing in a Hierarchical Server Topology
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
- Makespan minimization in online scheduling with machine eligibility
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm
This page was built for publication: Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
