Advertisement

Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision

  • Yong Wu
  • Qifan Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6124)

Abstract

This paper investigates semi-online scheduling problems on two parallel identical machines under a grade of service (GoS) provision. We consider two different semi-online versions where the optimal offline value of the instance is known in advance or the largest processing time of all jobs is known in advance. Respectively for two semi-online problems, we develop algorithms with competitive ratios of 3/2 and \((\sqrt{5}+1)/2\), which are shown to be optimal.

Keywords

Scheduling Semi-online Grade of service Two machines Competitive ratio 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hwang, H., Chang, S., Lee, K.: Parallel machine scheduling under a grade of service provision. Comput. Oper. Res. 31, 2055–2061 (2004)zbMATHCrossRefGoogle Scholar
  2. 2.
    Glass, C., Kellerer, H.: Parallel machine scheduling with job assignment restrictions. Naval Res. Logis. 54, 250–257 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bar-Noy, A., Freund, A., Naor, J.: On-line load balancing in a hierarchical server topology. SIAM J. Comput. 31, 527–549 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Crescenzi, P., Gambosi, G., Penna, P.: On-line algorithms for the channel assignment problem in cellular networks. Discret. Appl. Math. 137(3), 237–266 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Park, J., Chang, S.Y., Lee, K.: Online and semi-online scheduling of two machines under a grade of service provision. Oper. Res. Lett. 34, 692–696 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Jiang, Y.W., He, Y., Tang, C.M.: Optimal online algorithms for scheduling on two identical machines under a grade of service. J. Zhejiang Univ. Sci. A 7(3), 309–314 (2006)zbMATHCrossRefGoogle Scholar
  7. 7.
    Jiang, Y.W.: Online scheduling on parallel machines with two GoS levels. J. Comb. Optim. 16, 28–38 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Zhang, A., Jiang, Y.W., Tan, Z.Y.: Online parallel machines scheduling with two hierarchies. Theoret. Comput. Sci. 410, 3597–3605 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Liu, M., Chu, C.B., Xu, Y.F., Zheng, F.F.: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. J. Comb. Optim. (2009), doi:10.1007/s10878-009-9231-zGoogle Scholar
  10. 10.
    Chassid, O., Epstein, L.: The hierarchical model for load balancing on two machines. J. Comb. Optim. 15, 305–314 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Azar, Y., Epstein, L.: On-line machine covering. J. Sched. 1, 67–77 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Azar, Y., Regev, O.: On-line bin-stretching. Theoret. Comput. Sci. 168, 17–41 (2001)CrossRefMathSciNetGoogle Scholar
  13. 13.
    He, Y., Zhang, G.C.: Semi on-line scheduling on two identical machines. Computing 62(3), 179–187 (1999)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yong Wu
    • 1
  • Qifan Yang
    • 2
  1. 1.Department of Fundamental Education, Ningbo Institute of TechnologyZhejiang UniversityNingboPR China
  2. 2.Department of MathematicsZhejiang UniversityHangzhouPR China

Personalised recommendations