Advertisement

Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times

  • Taibo Luo
  • Yinfeng Xu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8546)

Abstract

In this paper, we consider the online hierarchical scheduling problem on two parallel machines, with the objective of maximizing the minimum machine load. Since no competitive algorithm exists for this problem, we consider the semi-online version with bounded processing times, in which the processing times are bounded by an interval [1,α] where α ≥ 1. We prove that no algorithm can have a competitive ratio less than 1 + α and give an optimal algorithm with the competitive ratio of 1 + α. Moreover, if we further know the sum of jobs’ processing time in advance, we prove that no algorithm can have a competitive ratio less than α where 1 ≤ α < 2, and we also propose an algorithm which is shown to be optimal for the case 1 ≤ α < 2.

Keywords

Scheduling Semi-online Load balancing Competitive ratio Hierarchy 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chassid, O., Epstein, L.: The hierarchical model for load balancing on two machines. Journal of Combinatorial Optimization 15, 305–314 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Hou, L., Kang, L.: Online and semi-online hierarchical scheduling for load balancing on uniform machines. Theoretical Computer Science 412, 1092–1098 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Hwang, H., Chang, S., Lee, K.: Parallel machine scheduling under a grade of service provision. Computers and Operations Research 31, 2055–2061 (2004)CrossRefzbMATHGoogle Scholar
  4. 4.
    Jiang, Y., He, Y., Tang, C.: Optimal online algorithms for scheduling on two identical machines under a grade of service. Journal of Zhejiang University. Science A 7, 309–314 (2006)CrossRefzbMATHGoogle Scholar
  5. 5.
    Liu, M., Chu, C., Xu, Y., Zheng, F.: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. Journal of Combinatorial Optimization 21, 138–149 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Luo, T., Xu, Y., Luo, L., He, C.: Semi-online scheduling with two GoS levels and unit processing time. Theoretical Computer Science 521, 62–72 (2014)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Park, J., Chang, S.K., Lee, K.: Online and semi-online scheduling of two machines under a grade of service provision. Operations Research Letters 34, 692–696 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Wu, Y., Cheng, T.C.E., Ji, M.: Optimal algorithm for semi-online machine covering on two hierarchical machines. Theoretical Computer Science 531, 37–46 (2014)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Wu, Y., Ji, M., Yang, Q.: Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. International Journal of Production Economics 135, 367–371 (2012)CrossRefGoogle Scholar
  10. 10.
    Wu, Y., Ji, M., Yang, Q.: Semi-Online Machine Covering under a Grade of Service Provision. Applied Mechanics and Materials 484, 101–102 (2011)Google Scholar
  11. 11.
    Zhang, A., Jiang, Y., Fan, L., Hu, J.: Optimal online algorithms on two hierarchical machines with tighly-grouped processing times. Journal of Combinatorial Optimization (2013), doi:10.1007/s10878-013-9627-7Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Taibo Luo
    • 1
  • Yinfeng Xu
    • 1
    • 2
  1. 1.Business SchoolSichuan UniversityChengduChina
  2. 2.State Key Lab. for Manufacturing Systems EngineeringXi’anChina

Personalised recommendations