| 改进遗传算法求解多时间约束的柔性作业车间调度问题 |
| |
| 引用本文： | 张国辉,胡一凡,孙靖贺.改进遗传算法求解多时间约束的柔性作业车间调度问题[J].工业工程,2020,23(2):19. |
| |
| 作者姓名： | 张国辉 胡一凡 孙靖贺 |
| |
| 作者单位： | 郑州航空工业管理学院 管理工程学院，河南 郑州 450015 |
| |
| 基金项目： | 国家自然科学基金资助项目（U1904167， 51705472）；教育部人文社科研究规划基金资助项目（18YJAZH125）；河南省科技创新杰出青年资助项目（184100510001） |
| |
| 摘 要： | 将加工时间、调整时间和移动时间分别作为独立时间因素考虑到柔性作业车间调度模型中，建立以最大完工时间最小、总调整时间最小、总移动时间最小为目标的考虑多时间约束的柔性作业车间调度模型，并提出改进的遗传算法求解该模型。通过测试标准数据集，并对比其他文献算法，验证了改进的遗传算法的可行性和有效性。
|
| 关 键 词： | 柔性作业车间调度 遗传算法 调整时间 移动时间 最大完工时间 |
| 收稿时间： | 2019-12-12 |
An Improved Genetic Algorithm for Flexible Job Shop Scheduling Problem with Multiple Time Constraints |
| |
| ZHANG Guohui,HU Yifan,SUN Jinghe.An Improved Genetic Algorithm for Flexible Job Shop Scheduling Problem with Multiple Time Constraints[J].Industrial Engineering Journal,2020,23(2):19. |
| |
| Authors: | ZHANG Guohui HU Yifan SUN Jinghe |
| |
| Affiliation: | School of Management Engineering, Zhengzhou University of Aeronautics, Zhengzhou 450015, China |
| |
| Abstract: | The processing time, set-up time and transport time are considered as independent time factors in the flexible job shop scheduling model. A flexible job shop scheduling model considering multiple time constraints is established with the goal of minimum makespan, minimum total set-up time and minimum total transport time. An improved genetic algorithm is proposed to solve the model. By testing the standard data set and comparing with other literature algorithms, the feasibility and effectiveness of the improved genetic algorithm are verified. |
| |
| Keywords: | flexible job shop scheduling genetic algorithm set-up time transport time makespan |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《工业工程》浏览原始摘要信息 |
|
点击此处可从《工业工程》下载全文 |
