首页 | 本学科首页   官方微博 | 高级检索  
     检索      

作业时间依赖顺序的拆卸线平衡多目标优化
引用本文:刘佳,王书伟.作业时间依赖顺序的拆卸线平衡多目标优化[J].中国管理科学,2021,29(4):158-168.
作者姓名:刘佳  王书伟
作者单位:1. 青岛理工大学商学院, 山东 青岛 266520;2. 山东科技大学经济管理学院, 山东 青岛 266590
基金项目:四川省教育厅自然科学一般项目(18ZB0587)
摘    要:在废旧产品拆卸时无先后关系约束的任务之间可能存在拆卸干扰,使任务作业时间依赖于拆卸顺序,导致产品总作业时间不确定,从而影响拆卸线的平衡。为此,考虑拆卸过程中任务间的相互干扰,以最小化拆卸成本和环境危害为目标,构建作业时间依赖顺序的拆卸线平衡多目标优化模型,并提出一种Pareto人工蜂群算法进行求解,采用混合生成法保证种群质量与多样性,设计变邻域深度搜索策略以提高雇佣蜂局部开采效率,为降低侦察蜂探测的盲目性采用基于外部存档的单点变异算子进行搜索。最后通过算例与实例验证算法的有效性以及平衡任务在拆卸线上分配的重要性。

关 键 词:拆卸线平衡  顺序相依  人工蜂群算法  帕累托  
收稿时间:2019-12-03
修稿时间:2020-03-11

Multi-objective Optimization for Disassembly Line Balancing Problem with Sequence-dependent Part Removal Times
LIU Jia,WANG Shu-wei.Multi-objective Optimization for Disassembly Line Balancing Problem with Sequence-dependent Part Removal Times[J].Chinese Journal of Management Science,2021,29(4):158-168.
Authors:LIU Jia  WANG Shu-wei
Institution:1. Business School, Qingdao University of Technology, Qingdao 266520, China;2. College of Economics&Management, Shandong University of Science and Technology, Qingdao 266590, China
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.
Keywords:disassembly line balancing problem  sequence-dependent  artificial bee colony  Pareto  
点击此处可从《中国管理科学》浏览原始摘要信息
点击此处可从《中国管理科学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号