主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2021, Vol. 29 ›› Issue (4): 158-168.doi: 10.16381/j.cnki.issn1003-207x.2019.2007

• Articles • Previous Articles     Next Articles

Multi-objective Optimization for Disassembly Line Balancing Problem with Sequence-dependent Part Removal Times

LIU Jia1, WANG Shu-wei2   

  1. 1. Business School, Qingdao University of Technology, Qingdao 266520, China;
    2. College of Economics&Management, Shandong University of Science and Technology, Qingdao 266590, China
  • Received:2019-12-03 Revised:2020-03-11 Published:2021-04-25

Abstract: Remanufacturing is an effective way to realize the reutilization of resources. Disassembly plays a key role in remanufacturing since it allows for the selective separation of desired parts from the end-of-life (EOL) products. Disassembly line is the best choiceto deal with EOL products on a large scale, so it is essential that it be designed and balanced to work efficiently. However, in the disassembly process, some parts may interact with each other and their disassembly times will be incremented by additional operations, and this affects the balance of disassembly line. In order to solve the disassembly interference among parts, in this research a sequence-dependent disassembly line balancing problem is presented with two objectives including minimization of the disassembly cost and environmental hazards. Then, a Pareto artificial bee colony algorithm is proposed for addressing this multi-objective optimization problem. A mixed strategy is designed to build an initial population with high quality and diversity, and some improvements are made in local exploitation and global exploration to accelerate the search speed. Finally, aset of benchmark instances is used to test the performance of the proposed algorithm. Computational results evidently indicate the superior efficiency of the proposed algorithm.In addition, a case study is presented to illustrate that balancing the tasks among workstations can effectively avoid the tasks with more time increments being disassembled on priority.

Key words: disassembly line balancing problem, sequence-dependent, artificial bee colony, Pareto

CLC Number: