An Improved Discrete Krill Herd Algorithm for Complex Product Assembly Scheduling Problem

被引：0
|
作者：
Zhuang C.-B. [1 ]
Xiong H. [1 ]
Liu J.-H. [1 ]
Tang C.-T. [1 ]
机构：
[1] School of Mechanical Engineering, Beijing Institute of Technology, Beijing
来源：
Xiong, Hui (xionghui@bit.edu.cn) | 2018年 / China Ordnance Industry Corporation卷 / 39期
关键词：
Assembly scheduling; Complex product; Hybrid flow-shop scheduling; Krill herd algorithm;
D O I：
10.3969/j.issn.1000-1093.2018.08.016
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
An improved discrete krill herd (IDKH) algorithm is proposed for the complex product assembly scheduling problem. The objective is to minimize the makespan. An assembly scheduling model is established by analyzing the characteristics of a complex product process flow. The transformation between scheduling solution and population individual is realized by using permutation-based coding and heuristic-based decoding methods. A local search and a restart operation procedure are presented to improve the exploitation and global exploration ability of basic krill herd (KH). The parameters of the proposed IDKH are calibrated by using a design of experimental approach. And a comparative evaluation is conducted with the well-known algorithms. The results show that the proposed IDKH has advantage over genetic algorithm, estimation of distribution algorithm, gravitational search algorithm, and basic KH in terms of quality and stability. © 2018, Editorial Board of Acta Armamentarii. All right reserved.
引用
收藏
页码：1590 / 1600
页数：10
相关论文
共 46 条
  • [1] Li B.-H., Chai X.-D., Virtual prototyping engineering for complex product, Computer Integrated Manufacturing Systems, 8, 9, pp. 678-683, (2002)
  • [2] Liu J.-H., Ding X.-F., Yuan D., Et al., Computer aided assembly process control and management system for complex product, Computer Integrated Manufacturing Systems, 16, 8, pp. 1622-1633, (2010)
  • [3] Gao L., Zhang G.-H., Wang X.-J., Flexible Job Shop Scheduling Intelligent Algorithms and Applications, (2012)
  • [4] Engin O., Doyen A., A new approach to solve hybrid flow shop scheduling problems by artificial immune system, Future Generation Computer Systems, 20, 6, pp. 1083-1095, (2004)
  • [5] Soewandi H., Elmaghraby S.E., Sequencing on two-stage hybrid flow shops with uniform machines to minimize makespan, IIE Transactions, 35, 5, pp. 467-477, (2003)
  • [6] Jungwattanakit J., Reodecha M., Chaovalitwongse P., Et al., Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, International Journal of Advanced Manufacturing Technology, 37, 3-4, pp. 354-370, (2008)
  • [7] Linn R., Zhang W., Hybrid flow shop scheduling: a survey, Computers & Industrial Engineering, 37, pp. 57-61, (1999)
  • [8] Johnson S.M., Optimal two and three stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 1, pp. 61-68, (1954)
  • [9] Brah S.A., Hunsucker J.L., Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, 51, pp. 88-99, (1991)
  • [10] Neron E., Baptiste P., Gupta J.N.D., Solving hybrid flow shop problem using energetic reasoning and global operations, Omega, 29, pp. 501-511, (2001)
12345