TY - JOUR
T1 - Double Auction-Based Manufacturing Cloud Service Allocation in an Industrial Park
AU - Kang, Kai
AU - Xu, Su Xiu
AU - Zhong, Ray Y.
AU - Tan, Bing Qing
AU - Huang, George Q.
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China under Grant 72071093, in part by the Department of Natural Resources of Guangdong Province (China) under Grant [2020]071, in part by the Pearl River Talent Recruitment Project of Guangdong under Grant 2017GC010445, in part by the ITF Innovation and Technology Support Program of Hong Kong Government under Grant ITP/079/16LP, in part by the HKSAR RGC GRF under Grant 17212016 and Grant 17200819, in part by Seed Fund for Basic Research in HKU under Grant 201906159001, in part by the 2019 Guangdong Special Support Talent Program–Innovation and Entrepreneurship Leading Team (China) under Grant 2019BT02S593, and in part by the National Key Research and Development Program of China under Grant 2019YFB1705400.
Publisher Copyright:
© 2004-2012 IEEE.
PY - 2022/1
Y1 - 2022/1
N2 - Industrial parks are regarded as a possible fashion to reduce the manufacturing costs and increase the efficiency by sharing cost-effective infrastructure and communal services. However, the waste of manufacturing resources could impede the development of manufacturing enterprises that locate in an industrial park when market demands fluctuate dynamically. This article aims to use the cloud manufacturing (CMfg) to relieve the temporary shortage of manufacturing resources and capabilities by sharing them among these enterprises in an industrial park. This article focuses on manufacturing cloud service allocation (MCSA), which is one of the critical processes to implement CMfg. Two multiunit double auction mechanisms are proposed to allocate the manufacturing cloud services (MCSs) with reasonable trade price in bilateral markets, and their properties and bidding strategies are proved. Numerical studies are conducted, and the results show the effectiveness and efficiency of two mechanisms for dealing with MCSA and verify the theoretical proofs. Note to Practitioners - MCSA in CMfg is a complicated and challenging task. The current industrial applications rely on optimization methods, such as all-in-one methods (e.g., genetic algorithm) and multidiscipline design optimization methods (e.g., analytical target cascading), to allocate MCSs. While these methods can help cloud operators obtain feasible allocation solutions rapidly, there exist several disadvantages: 1) they can only solve problems in one-sided settings (one customer with many providers); 2) there is an assumption that the customer's demand can be provided by any providers, which means providers' capacities are infinite; and 3) the problem is optimized based on the fixed prices provided by providers, without considering supply and demand. This article presents two multiunit double auction mechanisms that allow multiple customers to trade with multiple providers. Allocation rules can break the assumption and providers' capacities are limited. MCSs are also priced dynamically based on supply and demand. We show how cloud operators apply two mechanisms first and demonstrate their properties and bidding strategies of customers and providers when the mechanism is not incentive compatible. Finally, our experiments and analysis fully validate the applicability and efficiency of two mechanisms and illustrate how cloud operators can maximize their utilities.
AB - Industrial parks are regarded as a possible fashion to reduce the manufacturing costs and increase the efficiency by sharing cost-effective infrastructure and communal services. However, the waste of manufacturing resources could impede the development of manufacturing enterprises that locate in an industrial park when market demands fluctuate dynamically. This article aims to use the cloud manufacturing (CMfg) to relieve the temporary shortage of manufacturing resources and capabilities by sharing them among these enterprises in an industrial park. This article focuses on manufacturing cloud service allocation (MCSA), which is one of the critical processes to implement CMfg. Two multiunit double auction mechanisms are proposed to allocate the manufacturing cloud services (MCSs) with reasonable trade price in bilateral markets, and their properties and bidding strategies are proved. Numerical studies are conducted, and the results show the effectiveness and efficiency of two mechanisms for dealing with MCSA and verify the theoretical proofs. Note to Practitioners - MCSA in CMfg is a complicated and challenging task. The current industrial applications rely on optimization methods, such as all-in-one methods (e.g., genetic algorithm) and multidiscipline design optimization methods (e.g., analytical target cascading), to allocate MCSs. While these methods can help cloud operators obtain feasible allocation solutions rapidly, there exist several disadvantages: 1) they can only solve problems in one-sided settings (one customer with many providers); 2) there is an assumption that the customer's demand can be provided by any providers, which means providers' capacities are infinite; and 3) the problem is optimized based on the fixed prices provided by providers, without considering supply and demand. This article presents two multiunit double auction mechanisms that allow multiple customers to trade with multiple providers. Allocation rules can break the assumption and providers' capacities are limited. MCSs are also priced dynamically based on supply and demand. We show how cloud operators apply two mechanisms first and demonstrate their properties and bidding strategies of customers and providers when the mechanism is not incentive compatible. Finally, our experiments and analysis fully validate the applicability and efficiency of two mechanisms and illustrate how cloud operators can maximize their utilities.
KW - Cloud manufacturing (CMfg)
KW - double auction
KW - industrial park
KW - manufacturing cloud service allocation (MCSA)
UR - http://www.scopus.com/inward/record.url?scp=85096141375&partnerID=8YFLogxK
U2 - 10.1109/TASE.2020.3029081
DO - 10.1109/TASE.2020.3029081
M3 - Journal article
AN - SCOPUS:85096141375
SN - 1545-5955
VL - 19
SP - 295
EP - 307
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
IS - 1
ER -