Advertisement

4OR

, Volume 15, Issue 3, pp 265–276 | Cite as

Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements

  • Xianglai Qi
  • Jinjiang YuanEmail author
Research paper
  • 186 Downloads

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\)-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 

Mathematics Subject Classification

90B35 (Scheduling theory, deterministic) 90C27 (Combinatorial optimization) 

Notes

Acknowledgements

The authors would like to thank the associate editor and two anonymous referees for their constructive comments and kind suggestions. This research was financially supported by NSFC(11671368) and NSF-Henan(15IRTSTHN006).

Compliance with ethical standards

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  1. Avidor A, Azar Y, Sgall J (2001) Ancient and new algorithms for load balancing in the \(l_p\) norm. Algorithmica 29:422–441CrossRefGoogle Scholar
  2. Bar-Noy A, Freund A, Naor J (2001) Online load balancing in a hierarchical server topology. SIAM J Comput 31:527–549CrossRefGoogle Scholar
  3. Chandra AK, Wong CK (1975) Worst-case analysis of a placement algorithm related to storage allocation. SIAM J Comput 4:249–263CrossRefGoogle Scholar
  4. Chen X, Xu ZZ, Dósa G, Han X, Jiang H (2013) Semi-online hierarchical scheduling problems with buffer or rearrangements. Inf Process Lett 113:127–131CrossRefGoogle Scholar
  5. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326CrossRefGoogle Scholar
  6. Hwang HC, Chang SY, Lee K (2004) Parallel machine scheduling under a grade of service provision. Comput Oper Res 31:2055–2061CrossRefGoogle Scholar
  7. Jiang YW, He Y, Tang CM (2006) Optimal online algorithms for scheduling on two identical machines under a grade of service. J Zhejiang Univ Sci 7A:309–314CrossRefGoogle Scholar
  8. Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235–242CrossRefGoogle Scholar
  9. Lee K, Leung JY-T, Pinedo ML (2013) Makespan minimization in online scheduling with machine eligibility. Ann Oper Res 204:189–222CrossRefGoogle Scholar
  10. Leung JY-T, Li C-L (2008) Scheduling with processing set restrictions: a survey. Int J Prod Econ 116:251–262CrossRefGoogle Scholar
  11. Liu M, Chu CB, Xu YF, Zheng FF (2011) Semi-online scheduling on two machines under a grade of service provision with bounded processing times. J Comb Optim 21:138–149CrossRefGoogle Scholar
  12. Luo TB, Xu YF, Luo L, He CZ (2014) Semi-online scheduling with two GoS levels and unit processing time. Theor Comput Sci 521:62–72CrossRefGoogle Scholar
  13. Park J, Chang SY, Lee K (2006) Online and semi-online scheduling of two machines under a grade of service provision. Oper Res Lett 34:692–696CrossRefGoogle Scholar
  14. Qi XL, Yuan JJ (2016) Online and semi-online hierarchical scheduling for \(l_p\)-norm load balancing on two identical machines (submitted) Google Scholar
  15. Tan ZY, Zhang A (2011) Online hierarchical scheduling: an approach using mathematical programming. Theor Comput Sci 412:246–256CrossRefGoogle Scholar
  16. Wu Y, Ji M, Yang Q (2012) Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. Int J Prod Econ 135:367–371CrossRefGoogle Scholar
  17. Zhang A (2009) A study of online hierarchical scheduling and some related problems. Ph.D thesis, Zhejiang UniversityGoogle Scholar
  18. Zhang A, Jiang YW, Fan LD, Hu JL (2015) Optimal online algorithms on two hierarchical machines with tightly-grouped processing times. J Comb Optim 29:781–795CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.School of Mathematics and StatisticsZhengzhou UniversityZhengzhouPeople’s Republic of China

Personalised recommendations