Semi-online hierarchical scheduling for $$l_p$$ l p -norm load balancing with buffer or rearrangements
Xianglai Qi and
Jinjiang Yuan ()
Additional contact information
Xianglai Qi: Zhengzhou University
Jinjiang Yuan: Zhengzhou University
4OR, 2017, vol. 15, issue 3, 265-276
Abstract In this paper, we consider the semi-online hierarchical scheduling for load balancing on two identical machines. In the problem, the jobs are available online over list and the objective is to minimize the $$l_p$$ l p -norm of the two machines’ loads. Two semi-online versions are investigated: the buffer version and the rearrangement version. We design a unified optimal semi-online algorithm for both models.
Keywords: Scheduling; Semi-online; Hierarchical machines; Buffer; Rearrangement; 90B35 (Scheduling theory; deterministic); 90C27 (Combinatorial optimization) (search for similar items in EconPapers)
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10288-016-0334-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:aqjoor:v:15:y:2017:i:3:d:10.1007_s10288-016-0334-y
Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE
Access Statistics for this article
4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello
More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla ().