作业车间调度
数学优化
解算器
多目标优化
计算机科学
分类
调度(生产过程)
最优化问题
遗传算法
能源消耗
数学
地铁列车时刻表
工程类
算法
操作系统
电气工程
作者
Dongsheng Yang,Xianyu Zhou,Zhile Yang,Qiangqiang Jiang,Wei Feng
标识
DOI:10.1109/cec48606.2020.9185653
摘要
Flexible job shop scheduling problem (FJSP) has long been a complex problem due to the resource flexibility and strong constraints, generating a mixed-integer non-linear optimization problem. The problem becomes more complex with the increasing demand of energy reduction and the corresponding environmental impacts. Proper production scheduling is of significant potential in saving energy in the manufacturing system. In this paper, a multi-objective FJSP model is formulated with the objectives of minimizing the makespan and energy consumption considering strong transportation constraints. Two popular multi-objective optimization solver including Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and A Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D) are employed and compared in a real-world instance of the FJSP, associated with novel coding schemes. The results show that the proposed model is well solved by the two solvers and NSGA-II get the better solutions.
科研通智能强力驱动
Strongly Powered by AbleSci AI