Skip to main content
SpringerLink
Log in

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

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6124))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hwang, H., Chang, S., Lee, K.: Parallel machine scheduling under a grade of service provision. Comput. Oper. Res. 31, 2055–2061 (2004)

    Article  MATH  Google Scholar 

  2. Glass, C., Kellerer, H.: Parallel machine scheduling with job assignment restrictions. Naval Res. Logis. 54, 250–257 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bar-Noy, A., Freund, A., Naor, J.: On-line load balancing in a hierarchical server topology. SIAM J. Comput. 31, 527–549 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  7. Jiang, Y.W.: Online scheduling on parallel machines with two GoS levels. J. Comb. Optim. 16, 28–38 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Zhang, A., Jiang, Y.W., Tan, Z.Y.: Online parallel machines scheduling with two hierarchies. Theoret. Comput. Sci. 410, 3597–3605 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  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-z

    Google Scholar 

  10. Chassid, O., Epstein, L.: The hierarchical model for load balancing on two machines. J. Comb. Optim. 15, 305–314 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  11. Azar, Y., Epstein, L.: On-line machine covering. J. Sched. 1, 67–77 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Azar, Y., Regev, O.: On-line bin-stretching. Theoret. Comput. Sci. 168, 17–41 (2001)

    Article  MathSciNet  Google Scholar 

  13. He, Y., Zhang, G.C.: Semi on-line scheduling on two identical machines. Computing 62(3), 179–187 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Fundamental Education, Ningbo Institute of Technology, Zhejiang University, Ningbo, 315100, PR China

    Yong Wu

  2. Department of Mathematics, Zhejiang University, Hangzhou, 310027, PR China

    Qifan Yang

Authors
  1. Yong Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qifan Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Warwick Business School/ DIMAP - Centre for Discrete Mathematics and its Applications Coventry, University of Warwick, CV4 7AL, UK

    Bo Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, Y., Yang, Q. (2010). Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14355-7_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14354-0

  • Online ISBN: 978-3-642-14355-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation