Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Semi-online Algorithms for Hierarchical Scheduling on Three Parallel Machines with a Buffer Size of 1

  • Conference paper
  • First Online:
Theoretical Computer Science (NCTCS 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1352))

Included in the following conference series:

Abstract

In this paper, we study the online problem on three hierarchical machines with a buffer size of 1, and have two hierarchy, the objective is to minimize the maximum machine load. When there is only one low-hierarchy machine, we give a low bound \(\frac{3}{2}\) and present an online algorithm with competitive ratio at most \(\frac{5}{3}\). When there are two low-hierarchy machines, we give a lower bound \(\frac{3}{2}\) and present an online algorithm with competitive ratio at most \(\frac{12}{7}\).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 EPUB and 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

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Ou, J., Leung, J.Y.T., Li, C.L.: Scheduling parallel machines with inclusive processing set restrictions. Nav. Res. Logist. 55(4), 328–338 (2008)

    Article  MathSciNet  Google Scholar 

  3. Li, W., Li, J., Zhang, T.: Two approximation schemes for scheduling on parallel machines under a grade of service provision. Asia Pac. J. Oper. Res. 29(05), 83–94 (2012)

    Article  MathSciNet  Google Scholar 

  4. 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(6), 692–696 (2006)

    Article  MathSciNet  Google Scholar 

  5. Jiang, Y., He, Y., Tang, C.: 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  Google Scholar 

  6. Lim, K., Park, J., Chang, S.Y., Lee, K.: Online and semi-online scheduling of three machines under a GoS provision. In: Working Paper, Department of Industrial and Management Engineering, Pohang University of Science and Technology, Republic of Korea (2010)

    Google Scholar 

  7. Wu, Y., Ji, M., Yang, Q.: Optimal semi-online scheduling algorithm on two parallel identical machines under a grade of service provision. Int. J. Prod. Econ. 135(1), 367–371 (2012)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Zhang, A., Jiang, Y., Fan, L., Hu, J.: Optimal online algorithms on two hierarchical machines with tightly-grouped processing times. J. Comb. Optim. 29(4), 781–795 (2015)

    Article  MathSciNet  Google Scholar 

  10. Englert, M., Ozmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 603–612. IEEE (2008)

    Google Scholar 

  11. Lan, Y., Chen, X., Ding, N., Han, X.: Online minimum makespan scheduling with a buffer. In: Proceedings of the Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, pp. 161–171 (2012)

    Google Scholar 

  12. Zhang, G.: A simple semi on-line algorithm for P2//\(C_{max}\) with a buffer. Inf. Process. Lett. 61(3), 145–148 (1997)

    Article  Google Scholar 

  13. Chen, X., Xu, Z., Dosa, G., Han, X., Jiang, H.: Semi-online hierarchical scheduling problems with buffer or rearrangements. Inf. Process. Lett. 113(4), 127–131 (2013)

    Article  MathSciNet  Google Scholar 

  14. Li, J., Li, W., Li, J.: Polynomial approximation schemes for the max-min allocation problem under a grade of service provision. Discrete Math. Algorithms Appl. 1(03), 355–368 (2009)

    Article  MathSciNet  Google Scholar 

  15. Xiao, M., Wu, G., Li, W.: Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs. In: Sun, X., He, K., Chen, X. (eds.) NCTCS 2019. CCIS, vol. 1069, pp. 95–108. Springer, Singapore (2019). https://doi.org/10.1007/978-981-15-0105-0_7

    Chapter  Google Scholar 

Download references

Acknowledgements

The work is supported in part by the Program for Excellent Young Talents of Yunnan University, Training Program of National Science Fund for Distinguished Young Scholars, IRTSTYN, and Key Joint Project of the Science and Technology Department of Yunnan Province and Yunnan University [No. 2018FY001(-014)].

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xiao, M., Ding, L., Zhao, S., Li, W. (2021). Semi-online Algorithms for Hierarchical Scheduling on Three Parallel Machines with a Buffer Size of 1. In: He, K., Zhong, C., Cai, Z., Yin, Y. (eds) Theoretical Computer Science. NCTCS 2020. Communications in Computer and Information Science, vol 1352. Springer, Singapore. https://doi.org/10.1007/978-981-16-1877-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-1877-2_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-1876-5

  • Online ISBN: 978-981-16-1877-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics