A customer-oriented method to support multi-task green scheduling with diverse time-of-use prices in Cloud Manufacturing

被引:5
作者
Tong, Huagang [1 ]
Zhu, Jianjun [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Econ & Management, 29 Jiangjun Ave, Nanjing 211106, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Cloud Manufacturing; green manufacturing; just-in-time rule; multi-tasks scheduling; time-of-use price; artificial bee colony algorithm; RESOURCE-ALLOCATION; FLOW-SHOP; ALGORITHM; OPTIMIZATION; SELECTION;
D O I
10.1177/09544054221121848
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Green manufacturing has become a hot topic globally, and Cloud Manufacturing (CMfg) provides a novel approach to support green manufacturing through manufacturing services (MS) composition. In this study, we design a customer-oriented method for supporting multi-task green scheduling in CMfg. First, we aim to minimize the total energy consumption during scheduling. Second, because CMfg is a type of customer-oriented manufacturing, the just-in-time objective is used to meet the customers on-time requirements. Subsequently, we study the different time-of-use prices of MS in CMfg. The price of utilizing MS is related not only to cost but also to the supply-demand relationship, which results in diverse time-of-use prices for MS. After establishing the scheduling model, a hybrid artificial bee colony algorithm is designed to solve the scheduling model. For the algorithm, we design a guiding mechanism to enhance the global search ability and an adaptive variable neighborhood search for improving the local search ability. To verify the performance of our algorithm, we compared it with similar algorithms, and the results indicate the high-level performance of our work.
引用
收藏
页码:911 / 924
页数:14
相关论文
共 37 条
[1]   A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing [J].
Ahmadov, Yashar ;
Helo, Petri .
ANNALS OF OPERATIONS RESEARCH, 2018, 270 (1-2) :5-24
[2]   Cloud manufacturing service selection optimization and scheduling with transportation considerations: mixed-integer programming models [J].
Akbaripour, Hossein ;
Houshmand, Mahmoud ;
van Woensel, Tom ;
Mutlu, Nevin .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2018, 95 (1-4) :43-70
[3]   Lagrangian bounds for just-in-time job-shop scheduling [J].
Baptiste, Philippe ;
Flamini, Marta ;
Sourd, Francis .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (03) :906-915
[4]   A hybrid grey wolf optimizer algorithm with evolutionary operators for optimal QoS-aware service composition and optimal selection in cloud manufacturing [J].
Bouzary, Hamed ;
Chen, F. Frank .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2019, 101 (9-12) :2771-2784
[5]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[6]   Energy-aware resource service scheduling based on utility evaluation in cloud manufacturing system [J].
Cheng, Ying ;
Tao, Fei ;
Liu, Yilong ;
Zhao, Dongming ;
Zhang, Lin ;
Xu, Lida .
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2013, 227 (12) :1901-1915
[7]   A probabilistic-based extendable quantitative evaluation method for 3D printing service in cloud manufacturing [J].
Cui, Jin ;
Zhang, Lin .
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2021, 235 (12) :1917-1926
[8]   An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search [J].
DauzerePeres, S ;
Paulli, J .
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :281-306
[9]   A utility-based matching mechanism for stable and optimal resource allocation in cloud manufacturing platforms using deferred acceptance algorithm [J].
Delaram, Jalal ;
Houshamand, Mahmoud ;
Ashtiani, Farid ;
Valilai, Omid Fatahi .
JOURNAL OF MANUFACTURING SYSTEMS, 2021, 60 :569-584
[10]   Peter Drucker-the grandfather of marketing: an interview with Dr. Philip Kotler [J].
Gunther, Robert E. .
JOURNAL OF THE ACADEMY OF MARKETING SCIENCE, 2009, 37 (01) :17-19