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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Chassid, O., Epstein, L.: The hierarchical model for load balancing on two machines. J. Comb. Optim. 15(4), 305–314 (2008)
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)
Epstein, L., Levin, A., van Stee, R.: Max-min online allocations with a reordering buffer. SIAM J. Discrete Math. 25(3), 1230–1250 (2011)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563–1581 (1966)
Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21, 235–242 (1997)
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)
Leung, J.Y.T., Li, C.L.: Scheduling with processing set restrictions: a literature update. Int. J. Prod. Econ. 175, 1–11 (2016)
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)
Luo, T., Xu, Y.: Semi-online hierarchical load balancing problem with bounded processing times. Theoret. Comput. Sci. 607, 75–82 (2015)
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
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)
Wu, G., Li, W.: Semi-online machine covering on two hierarchical machines with discrete processing times. Commun. Comput. Inf. Sci. 882, 1–7 (2018)
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
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
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)
