3.8 Proceedings Paper

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

出版社

IEEE

关键词

MTO; order static scheduling; rush order dynamic rescheduling; multiobjecfive optimization; MOEA/D

资金

  1. National Key Research and Development Program of China [2018YFB1700400]
  2. Fund for the National Natural Science Foundation of China [61573086]
  3. Major Program of National Natural Science Foundation of China [71790614]
  4. Major International Joint Research Project of the National Natural Science Foundation of China [71520107004]
  5. 111 Project [B16009]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据