An Improved MOEA/D Algorithm for the Carbon Black Production Line Static and Dynamic Multiobjective Scheduling Problem

CEC(2020)

引用 2|浏览13
暂无评分
摘要
The make-to-order (MTO) manufacturers generally make production plans based on orders, which can help enterprises effectively avoid market risks, reduce market pressure and improve competitiveness. However, due to the characteristics of MTO production mode, the order static scheduling problem and rush order dynamic rescheduling problem have become more and more important for these MTO manufacturers. Therefore, in this paper, we take the packaging production line of a typical carbon black production enterprise as the research background to study the carbon black production line static and dynamic multiobjective scheduling problem. Firstly, multiobjective optimization models of both order static scheduling and rush order dynamic rescheduling are established. Then the improved MOEA/D algorithm combined the heuristic algorithm based on heuristic rules and discrete dynamic local search is developed to solve these two models. Based on the actual production data, eight instances of order static scheduling problems of different scales and four instances of rush order dynamic rescheduling problems of different scales are constructed respectively. Experimental results illustrate that the improved MOEA/D is effective and superior in solving these two problems.
更多
查看译文
关键词
MTO, order static scheduling, rush order dynamic rescheduling, multiobjecfive optimization, MOEA/D
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要