摘要
Aiming at the limitation of flexible job shop scheduling (JSP), a multi-objective optimization model of JSP is constructed, which takes the maximum completion time and delivery time as the objective function. Considering the actual inventory size of job shop, a non dominated genetic algorithm is proposed. Combined with the actual inventory and demand, the program is developed to verify the feasibility and effectiveness of the algorithm. The results show that the algorithm can meet the delivery time and the maximum completion time at the same time, considering the size of inventory and achieve satisfactory results.
源语言 | 英语 |
---|---|
主期刊名 | Proceedings - International Conference on Artificial Intelligence and Electromechanical Automation, AIEA 2020 |
出版商 | Institute of Electrical and Electronics Engineers Inc. |
页 | 260-263 |
页数 | 4 |
ISBN(电子版) | 9781728182889 |
DOI | |
出版状态 | 已出版 - 6月 2020 |
已对外发布 | 是 |
活动 | 2020 International Conference on Artificial Intelligence and Electromechanical Automation, AIEA 2020 - Tianjin, 中国 期限: 26 6月 2020 → 28 6月 2020 |
出版系列
姓名 | Proceedings - International Conference on Artificial Intelligence and Electromechanical Automation, AIEA 2020 |
---|
会议
会议 | 2020 International Conference on Artificial Intelligence and Electromechanical Automation, AIEA 2020 |
---|---|
国家/地区 | 中国 |
市 | Tianjin |
时期 | 26/06/20 → 28/06/20 |
指纹
探究 'Multi-objective flexible job shop scheduling problem based on non-dominated genetic algorithm' 的科研主题。它们共同构成独一无二的指纹。引用此
Yacong, Y., Aimin, W., & Yan, G. (2020). Multi-objective flexible job shop scheduling problem based on non-dominated genetic algorithm. 在 Proceedings - International Conference on Artificial Intelligence and Electromechanical Automation, AIEA 2020 (页码 260-263). 文章 9221465 (Proceedings - International Conference on Artificial Intelligence and Electromechanical Automation, AIEA 2020). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/AIEA51086.2020.00062