Double Auction-Based Manufacturing Cloud Service Allocation in an Industrial Park

被引:21
作者
Kang, Kai [1 ]
Xu, Su Xiu [2 ,3 ]
Zhong, Ray Y. [1 ]
Tan, Bing Qing [4 ]
Huang, George Q. [1 ]
机构
[1] Univ Hong Kong, Dept Ind & Mfg Syst Engn, Hong Kong, Peoples R China
[2] Jinan Univ, Inst Phys Internet, Sch Intelligent Syst Sci & Engn, Zhuhai Campus, Zhuhai 519070, Peoples R China
[3] Jinan Univ, Management Sch, Guangzhou 510632, Peoples R China
[4] Jinan Univ, Sch Management, Guangzhou 510632, Peoples R China
基金
中国国家自然科学基金;
关键词
Manufacturing; Resource management; Task analysis; Supply and demand; Logistics; Marine vehicles; Pricing; Cloud manufacturing (CMfg); double auction; manufacturing cloud service allocation (MCSA); industrial park; AUGMENTED LAGRANGIAN COORDINATION; OPTIMAL CONFIGURATION; SUPPLY CHAIN; DESIGN; PROCUREMENT; MECHANISMS; DEMAND; MODEL; HUB;
D O I
10.1109/TASE.2020.3029081
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:295 / 307
页数:13
相关论文
共 41 条
  • [1] Modelling on service capability maturity and resource configuration for public warehouse product service systems
    Cao, Wei
    Jiang, Pingyu
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (06) : 1898 - 1921
  • [2] Truthful multi-unit multi-attribute double auctions for perishable supply chain trading
    Cheng, Meng
    Xu, Su Xiu
    Huang, George Q.
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 93 : 21 - 37
  • [3] Truthful double auction mechanisms
    Chu, Leon Yang
    Shen, Zuo-Jun Max
    [J]. OPERATIONS RESEARCH, 2008, 56 (01) : 102 - 120
  • [4] Trade reduction vs. multi-stage: A comparison of double auction design approaches
    Chu, Leon Yang
    Shen, Zuo-Jun Max
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 180 (02) : 677 - 691
  • [5] Truthful Bundle/Multiunit Double Auctions
    Chu, Leon Yang
    [J]. MANAGEMENT SCIENCE, 2009, 55 (07) : 1184 - 1198
  • [6] Francis C., 2001, Environmental Management of Industrial Estates
  • [7] Truthful multi-unit transportation procurement auctions for logistics e-marketplaces
    Huang, George Q.
    Xu, Su Xiu
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2013, 47 : 127 - 148
  • [8] Design of a multi-unit double auction E-market
    Huang, P
    Scheller-Wolf, A
    Sycara, K
    [J]. COMPUTATIONAL INTELLIGENCE, 2002, 18 (04) : 596 - 617
  • [9] Auction-based cloud service allocation and sharing for logistics product service system
    Kang, Kai
    Zhong, Ray Y.
    Xu, Su Xiu
    Tan, Bing Qing
    Wang, Lihui
    Peng, Tao
    [J]. JOURNAL OF CLEANER PRODUCTION, 2021, 278
  • [10] Cloud-enabled sharing in logistics product service system
    Kang, Kai
    Zhong, Ray Y.
    Xu, Suxiu
    [J]. 11TH CIRP CONFERENCE ON INDUSTRIAL PRODUCT-SERVICE SYSTEMS, 2019, 83 : 451 - 455