A cooperative approach to service booking and scheduling in cloud manufacturing

被引:65
作者
Chen, Jian [1 ,2 ]
Huang, George Q. [2 ]
Wang, Jun-Qiang [3 ,4 ]
Yang, Chen [2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Econ & Management, 29 Jiangjun Ave, Nanjing 211106, Jiangsu, Peoples R China
[2] Univ Hong Kong, HKU ZIRI Lab Phys Internet, Dept Ind & Mfg Syst Engn, Pokfulam Rd, Hong Kong, Peoples R China
[3] Northwestern Polytech Univ, Performance Anal Ctr Prod & Operat Syst PacPos, Xian 710072, Shaanxi, Peoples R China
[4] Northwestern Polytech Univ, Key Lab Contemporary Design & Integrated Mfg Tech, Minist Educ, Xian 710072, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; Cloud manufacturing; Client coordination; Service booking; Manufacturing synchronization; SEQUENCING SITUATIONS; DELIVERY;
D O I
10.1016/j.ejor.2018.09.007
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Cloud manufacturing (CMfg) can make mass manufacturing resources more widely accessible to clients in the form of manufacturing services with their available time slots and the associated prices. In decentralized cases, clients can select optimal services to fulfill their individual demand. This paper proposes that clients can coordinate with each other for the exchange and reutilization of their booked resources. Via client coordination cost savings are derived from the post-optimization of the initial uncoordinated solution of all clients at the planning horizon. The optimization problem, which is a service booking and scheduling problem, has been proved to be strong NP-hard. Besides, we consider manufacturing synchronization (MfgSync) when scheduling a client's job on multiple resources, which includes simultaneity of completing the sub-tasks of a client's manufacturing job and punctuality of fulfilling the job. Optimal solution algorithms based on dynamic programming are proposed for two common cases. Considering the selfishness of each client, the success of the coordination depends on whether every participant can be better off than to act independently. We develop a cooperative game for client coordination and propose a core cost savings allocation scheme with which every client can get benefits through coordination. Based on the allocation scheme, clients tend to form a grand coalition. The computational results show that our approach can make substantial cost savings for clients. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:861 / 873
页数:13
相关论文
共 28 条
[1]  
[Anonymous], 2016, SCHEDULING THEORY AL, DOI DOI 10.1007/978-3-319-26580-3
[2]   Coordination of Outsourced Operations to Minimize Weighted Flow Time and Capacity Booking Costs [J].
Aydinliyim, Tolga ;
Vairaktarakis, George L. .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2010, 12 (02) :236-255
[3]   On the convexity of games corresponding to sequencing situations with due dates [J].
Borm, P ;
Fiestras-Janeiro, G ;
Hamers, H ;
Sánchez, E ;
Voorneveld, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 136 (03) :616-634
[4]  
Branzei R., 2008, MODELCOOPERATIVE G, V556
[5]   Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs [J].
Cai, Xiaoqiang ;
Vairaktarakis, George L. .
OPERATIONS RESEARCH, 2012, 60 (06) :1436-1450
[6]   On a new class of parallel sequencing situations and related games [J].
Calleja, P ;
Borm, P ;
Hamers, H ;
Klijn, F ;
Slikker, M .
ANNALS OF OPERATIONS RESEARCH, 2002, 109 (1-4) :265-277
[7]   Synchronisation of production scheduling and shipment in an assembly flowshop [J].
Chen, Jian ;
Huang, George Q. ;
Luo, Hao ;
Wang, Junqiang .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (09) :2787-2802
[8]   Integrated Production and Outbound Distribution Scheduling: Review and Extensions [J].
Chen, Zhi-Long .
OPERATIONS RESEARCH, 2010, 58 (01) :130-148
[9]   SEQUENCING GAMES [J].
CURIEL, I ;
PEDERZOLI, G ;
TIJS, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 40 (03) :344-351
[10]   SEQUENCING AND COOPERATION [J].
CURIEL, I ;
POTTERS, J ;
PRASAD, R ;
TIJS, S ;
VELTMAN, B .
OPERATIONS RESEARCH, 1994, 42 (03) :566-568