Skip to main content
SpringerLink
Log in

Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs

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

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

Included in the following conference series:

Abstract

In this paper, we consider the online machine covering problem on two hierarchical machines with known the total size of low-hierarchy. We present several best possible online algorithms when some addition information is known or a buffer is given.

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

References

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

    Article  MathSciNet  Google Scholar 

  2. Chen, X., Ding, N., Dósa, G., Han, X., Jiang, H.: Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs. Int. J. Comput. Math. 92(5), 873–881 (2015)

    Article  MathSciNet  Google Scholar 

  3. Epstein, L., Levin, A., van Stee, R.: Max-min online allocations with a reordering buffer. SIAM J. Discrete Math. 25(3), 1230–1250 (2011)

    Article  MathSciNet  Google Scholar 

  4. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563–1581 (1966)

    Article  Google Scholar 

  5. Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21, 235–242 (1997)

    Article  MathSciNet  Google Scholar 

  6. He, Y.: Semi-on-line scheduling problems for maximizing the minimum machine completion time. Acta Mathematicae Applicatae Sinica (Engl. Ser.) 17(1), 107–113 (2001)

    Article  MathSciNet  Google Scholar 

  7. Leung, J.Y.T., Li, C.L.: Scheduling with processing set restrictions: a literature update. Int. J. Prod. Econ. 175, 1–11 (2016)

    Article  Google Scholar 

  8. 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(3), 355–368 (2009)

    Article  MathSciNet  Google Scholar 

  9. Luo, T., Xu, Y.: Semi-online hierarchical load balancing problem with bounded processing times. Theoret. Comput. Sci. 607, 75–82 (2015)

    Article  MathSciNet  Google Scholar 

  10. Tan, Z., Zhang, A.: Online and semi-online scheduling. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 2191–2252. Springer, New York (2013). https://doi.org/10.1007/978-1-4419-7997-1_2

    Chapter  Google Scholar 

  11. Wu, Y., Cheng, T.C.E., Ji, M.: Optimal algorithm for semi-online machine covering on two hierarchical machines. Theoret. Comput. Sci. 531, 37–46 (2014)

    Article  MathSciNet  Google Scholar 

  12. Wu, G., Li, W.: Semi-online machine covering on two hierarchical machines with discrete processing times. Commun. Comput. Inf. Sci. 882, 1–7 (2018)

    Google Scholar 

Download references

Acknowledgements

The work is supported in part by the National Natural Science Foundation of China [No. 61662088], 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

  1. School of Mathematics and Statistics, Yunnan University, Kunming, 650504, People’s Republic of China

    Man Xiao, Gangxiong Wu & Weidong Li

  2. Dianchi College of Yunnan University, Kunming, 650000, People’s Republic of China

    Weidong Li

Authors
  1. Man Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gangxiong Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weidong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weidong Li .

Editor information

Editors and Affiliations

  1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    Xiaoming Sun

  2. Huazhong University of Science and Technology, Wuhan, China

    Kun He

  3. Lanzhou University, Lanzhou, China

    Xiaoyun Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xiao, M., Wu, G., Li, W. (2019). Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs. In: Sun, X., He, K., Chen, X. (eds) Theoretical Computer Science. NCTCS 2019. Communications in Computer and Information Science, vol 1069. Springer, Singapore. https://doi.org/10.1007/978-981-15-0105-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-0105-0_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-0104-3

  • Online ISBN: 978-981-15-0105-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation