Resource allocation model in cloud manufacturing

被引:32
作者
Wang, Shi-long [1 ]
Zhu, Zhe-qi [1 ]
Kang, Ling [1 ]
机构
[1] Chongqing Univ, State Key Lab Mech Transmiss, 309 Room,7 Teaching Bldg, Chongqing, Peoples R China
关键词
Cloud manufacturing; resources evaluation mechanism; resources organization structure; resources scheduling strategy; SSFLA;
D O I
10.1177/0954406215582016
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
Allocation of resources in cloud manufacturing is one of the key points of cloud manufacturing technology. To optimize cloud manufacturing resource management, it is indispensable to improve the process and efficiency of scheduling by matching jobs with resources according to the size of the job and establishing a four-level structure for resources based on the enterprise level, workshop level, primitive cell and service level. A resource scheduling model containing four indicators of cost, time, quality and risk with their own mathematical expressions is proposed. We also simulate the model with a new swap-shuffled leap-frog algorithm (SSFLA). Finally, we test the algorithm with different example scales and different end conditions and compare it with particle swarm optimization (PSO) and genetic algorithm (GA). The result shows that SSFLA performs well in convergence speed and robustness and does much better than PSO and GA. This algorithm provides an alternative choice for allocation of resources in cloud manufacturing model.
引用
收藏
页码:1726 / 1741
页数:16
相关论文
共 42 条
[1]  
[Anonymous], MANUFACTURE INFORM E
[2]  
[Anonymous], 1997, Eco-efficiency: The business link to sustainable development
[3]   DUAL PROCESSOR SCHEDULING WITH DYNAMIC REASSIGNMENT [J].
BOKHARI, SH .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (04) :341-349
[4]  
Chuan-Shun Z, 2006, CHIN MECH ENG, V18, P381
[5]   A modified shuffled frog-leaping optimization algorithm: applications to project management [J].
Elbeltagi, Emad ;
Hegazy, Tarek ;
Grierson, Donald .
STRUCTURE AND INFRASTRUCTURE ENGINEERING, 2007, 3 (01) :53-60
[6]   Application service providers: Challenges and opportunities [J].
Flammia, G .
IEEE INTELLIGENT SYSTEMS & THEIR APPLICATIONS, 2001, 16 (01) :22-23
[7]  
He Kun, 2005, Journal of Wuhan University of Technology (Information & Management Engineering), V27, P1
[8]   Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models [J].
Hu, PC .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2005, 25 (9-10) :1046-1052
[9]  
Julien F. M., 1990, Journal of Manufacturing and Operations Management, V3, P177
[10]  
Ke-qiang Y, 2009, COMPUT ENG, V35, P184