A Composition in Cloud Manufacturing with QoS-conscious Carrier Using GS Algorithm
DOI:
https://doi.org/10.61841/4yrcwx39Keywords:
Cloud Manufacturing (CMfg), Gale–Shapley (GS) Algorithm, Carrier Composition, Most Appropriate-DeterminationAbstract
Cloud manufacturing (CMfg) is a rising paradigm that targets to furnish on-demand manufacturing services over the internet. Carrier composition as a primary way for generating price-delivered services plays an important function in attaining the goal of CMfg. Most of the earlier works are all in favor of exploring techniques of carrier composition for a single composite undertaking making use of meta-heuristic algorithms. Nonetheless, the challenge of service composition for multiple composite duties has hardly ever been regarded. Meta-heuristic algorithms suffer from cumbersome parameter tuning as well as the tendency to enter regional optima. In addition, the effectiveness of different algorithms has not yet been fully explored when one-of-a-kind degrees of constraints are imposed. Unique from systems in many of the prior works, this paper proposes an increased Gale– Shapley (GS) algorithm-headquartered technique for provider com-function that enables iteration of multiple provider composition options simply. Standards with one-of-a-kind constraints are viewed. Experimental results indicate that 1) Meta-heuristic algorithms can be used in various situations with different degrees of constraints. Nonetheless, they are incapable of discovering the superior solutions in instances with fairly loose constraints, and over, the failure price of finding solutions for a batch of multiple tasks is high 2) Dynamic programming (DP) is a method that's the most sensitive to constraints. It performs best beneath loose constraints and within the case of a single requirement, and 3) the application range of the GS system proposed is wider than that of the DP method. It may possibly attain higher performance when constraints are comfortable irrespective of assignment popularity (i.e., a single undertaking or multiple duties), and furthermore, it will probably make extra duties in finding solutions in the multitask situation without carrier reuse.
Downloads
References
[1] B.H. Li et al., “Cloud manufacturing: A new service-oriented networked manufacturing model,” Comput. Int.
Manuf. Syst., vol. 16, no. 1, pp. 1–7, 2010.
[2] Y. Liu and X. Xu, “Industry 4.0 and cloud manufacturing: A comparative analysis,” J. Manuf. Sci. Eng., vol.
139, no. 3, 2017, Art. no. 034701.
[3] L. Zhang et al., “Cloud manufacturing: A new manufacturing paradigm,” Enterprise Inf. Syst., vol. 8, no. 2, pp.
167–187, 2014.
[4] F. Tao, D. Zhao, H. Yefa, and Z. Zhou, “Correlation-aware resource service composition and optimal-selection
in manufacturing grid,” EurOper. Res., vol. 201, no. 1, pp. 129–143, 2010.
[5] N. Liu and X. Li, A Resource Virtualization Mechanism for forCloud Manufacturing Systems. Lecture Notes in
Business Information Processing, vol. 122. Heidelberg, Germany: Springer, 2012, pp. 46–59.
[6] L. Zhang, H. Guo, F. Tao, Y.L. Luo, and N. Si, “Flexible management of resource service composition in cloud
manufacturing,” in Proc. IEEE Int. Conf. Ind. Eng. Manag. (IEEM), 2010, pp. 2278–2282.
[7] F. Li, L. Zhang, Y. Liu, Y. Laili, and F. Tao, “A clustering network-based approach to service composition in
cloud manufacturing,” Int. Comput. Integr. Manuf., vol. 30, no. 12, pp. 1331–1342, 2017.
[8] Y. Liu, X. Xu, L. Zhang, L. Wang, and R.Y. Zhong, “Workload-based multi-task scheduling in cloud
manufacturing,” Robot. Comput. Integr. Manuf., vol. 45, pp. 3–20, Jun. 2017.
[9] H. Jin, X. Yao, and Y. Chen, “Correlation-aware QoS modeling and manufacturing cloud service composition,”
J. Intell. Manuf., vol. 28, no. 8, pp. 1947–1960, 2017.
[10] Y. Lailiet al., “A ranking chaos algorithm for dual scheduling of cloud service and computing resource in
private cloud,” Comput. Ind., vol. 64, no. 4, pp. 448–463, 2013.
[11] J. Lartigau, X. Xu, L. Nie, and D. Zhan, “Cloud manufacturing service composition based on QoS with geoperspective transportation using an improved artificial bee colony optimisation algorithm,” Int. J. Prod. Res.,
vol. 53, no. 14, pp. 4380–4404, 2015.
[12] Z. Ding, J. Liu, Y. Liu, C. Jiang, and M. Zhou, “A transaction and QoS-aware service selection approach based
on genetic algorithm,” IEEE Trans. Syst., Man, Cybern., Syst., vol. 45, no. 7, pp. 1035–1046, Jul. 2015.
[13] Q. Wu, F. Ishikawa, Q. Zhu, and D.-H. Shin, “QoS-aware multigran-ularity service composition: Modeling and
optimization,” IEEE Trans. Syst., Man, Cybern., Syst., vol. 46, no. 11, pp. 1565–1577, Nov. 2016.
[14] D. Gale and L. S. Shapley, “College admissions and the stability of marriage,” Amer. Math. Monthly, vol. 69,
no. 1, pp. 9–15, 1962.
[15] C.C. Huang, “Cheating by men in the Gale–Shapley stable matching algorithm,” in Proc. Eur. Symp.
Algorithms, Zürich, Switzerland, 2006, pp. 418–431.
[16] E.L. Carano, S.Y. Liu, and J.K. Hedrick, “Applying the Gale–Shapley stable matching algorithm to peer
human-robot task allocation,” in Proc. ASME Dyn. Syst. Control Conf., 2014, p. 9.
[17] V. Bansal, A. Agrawal, and V.S. Malhotra, “Stable marriages with multiple partners: Efficient search for an
optimal solution,” in Proc. Int. Colloquium Automata Lang. Program., Eindhoven, The Netherlands, 2003, pp.
527–542.
[18] S. G. Kisel’gof, “Generalized matchings for preferences represented by simplest semiorder: Stability and pareto
optimality,” Autom. Remote Control, vol. 75, no. 6, pp. 1069–1077, 2014.
[19] N. Gatti, “Extending the alternating-offers protocol in the presence of competition: Models and theoretical
analysis,” Ann. Math. Artif. Intell., vol. 55, pp. 189–236, Apr. 2009.
[20] M. Sotomayor, “Connecting the cooperative and competitive structures of the multiple-partner’s assignment game,” J. Econ. Theory, vol. 134, no. 1, pp. 155–174, 2007.
[21] Rajendran T et al. “Recent Innovations in Soft Computing Applications,” Current Signal Transduction Therapy, Vol. 14, No. 2, pp. 129–130, 2019.
[22] Emayavaramban G et al. “Identifying User Suitability in sEMG based Hand Prosthesis for using Neural
Networks,” Current Signal Transduction Therapy, Vol. 14, No. 2, pp. 158–164, 2019.
[23] Rajendran T & Sridhar KP. “Epileptic seizure classification using feedforward neural network based on
parametric features.” International Journal of Pharmaceutical Research. 10(4): 189-196, 2018.
[24] Hariraj V et al. “Fuzzy multi-layer SVM classification of breast cancer mammogram images,” International
Journal of Mechanical Engineering and Technology, Vol. 9, No. 8, pp. 1281-1299, 2018.
[25] Muthu F et al. “Design of CMOS 8-bit parallel adder energy efficient structure using SR-CPL logic style.”
Pakistan Journal of Biotechnology. Vol. 14, No. Special Issue II, pp. 257-260, 2017.
[26] Keerthivasan S et al. “Design of low intricate 10-bit current steering digital to analog converter circuitry using
full swing, GDI.” Pakistan Journal of Biotechnology. Vol. 14, No. Special Issue II, pp. 204-208, 2017.
[27] Vijayakumar P et al. “Efficient implementation of decoder using modified soft decoding algorithm in Golay (24, 12) code.” Pakistan Journal of Biotechnology. Vol. 14, No. Special Issue II, pp. 200-203, 2017.
[28] Rajendran T et al. “Performance analysis of fuzzy multilayer support vector machine for epileptic seizure disorder classification using auto regression features.” Open Biomedical Engineering Journal. Vol. 13, pp. 103-113, 2019.
[29] Rajendran T et al. “Advanced algorithms for medical image processing.” Open Biomedical Engineering Journal, Vol. 13, 102, 2019.
[30] Anitha T et al. “Brain-computer interface for persons with motor disabilities - A review.” Open Biomedical Engineering Journal, Vol. 13, pp. 127-133, 2019.
[31] Yuvaraj P et al. “Design of 4-bit multiplexer using sub-threshold adiabatic logic (STAL).” Pakistan Journal of Biotechnology. Vol. 14, No. Special Issue II, pp. 261-264, 2017.
Downloads
Published
Issue
Section
License
Copyright (c) 2020 AUTHOR

This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.