Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
type: Item
instance of: scholarly article
title: Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
zbMATH Open document ID: 1374.90165
author: Xianglai Qi
author: Jinjiang Yuan
published in: 4OR
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6807751
zbMATH Keywords: scheduling
zbMATH Keywords: semi-online
zbMATH Keywords: hierarchical machines
zbMATH Keywords: buffer
zbMATH Keywords: rearrangement
MaRDI profile type: Publication
full work available at URL: s10288-016-0334-y
OpenAlex ID: W2551922410
cites work: Ancient and new algorithms for load balancing in the \(\ell_p\) norm
cites work: On-line load balancing in a hierarchical server topology
cites work: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
cites work: Semi-online hierarchical scheduling problems with buffer or rearrangements
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Parallel machine scheduling under a grade of service provision
cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service
cites work: Semi on-line algorithms for the partition problem
cites work: Makespan minimization in online scheduling with machine eligibility
cites work: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
cites work: Semi-online scheduling with two GoS levels and unit processing time
cites work: Online and semi-online scheduling of two machines under a grade of service provision
cites work: Online hierarchical scheduling: an approach using mathematical programming
cites work: Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
DOI: 10.1007/S10288-016-0334-Y
Recommended article: Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
Recommended article: Semi-online hierarchical scheduling problems with buffer or rearrangements
Recommended article: Semi-online hierarchical load balancing problem with bounded processing times
Recommended article: Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times
Recommended article: Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
Recommended article: Q3610725
Recommended article: Online vector scheduling and generalized load balancing
Recommended article: A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
Recommended article: Semi-online scheduling revisited
Recommended article: An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
description: scientific article; zbMATH DE number 6807751