《计算机应用研究》|Application Research of Computers

考虑工件移动时间的柔性作业车间调度问题研究

Research on flexible Job-Shop scheduling problem considering job movement time

免费全文下载 (已被下载 次)  
获取PDF全文
作者 张国辉,党世杰
机构 郑州航空工业管理学院 管理工程学院,郑州 450015
统计 摘要被查看 次,已被下载
文章编号 1001-3695(2017)08-2329-03
DOI 10.3969/j.issn.1001-3695.2017.08.021
摘要 分析生产车间的实际生产状况,建立了考虑工件移动时间的柔性作业车间调度问题模型。该模型考虑了以往柔性作业车间调度问题模型所没有考虑的工件在加工机器间的移动时间,使柔性作业车间调度问题更贴近实际生产,让调度理论更具现实性。通过对已有的改进遗传算法的遗传操作进行重构,设计出有效求解考虑工件移动时间的柔性作业车间调度问题的改进遗传算法。最后对实际案例进行求解,得到调度甘特图和析取图,通过对甘特图和析取图的分析验证了所建考虑工件移动时间的柔性作业车间调度问题模型的可行性和有效性。
关键词 工件移动时间;柔性作业车间调度问题;析取图;遗传算法
基金项目 国家自然科学基金资助项目(61203179)
航空科学基金资助项目(2014ZG55016)
河南省高校科技创新人才支持计划资助项目(14HASTIT006)
河南省高等学校青年骨干教师计划资助项目(2014GGJS-105)
河南省高等学校重点科研项目(16A460025)
本文URL http://www.arocmag.com/article/01-2017-08-021.html
英文标题 Research on flexible Job-Shop scheduling problem considering job movement time
作者英文名 Zhang Guohui, Dang Shijie
机构英文名 SchoolofManagementEngineering,ZhengzhouUniversityofAeronautics,Zhengzhou450015,China
英文摘要 According to the actual situation of the Job-Shop, this paper established a flexible Job-Shop scheduling problem model considered job movement time. It took jobs movement time among machines into consideration which was ignored in the classic flexible Job-Shop scheduling problem, the constraint made the problem more close to the actual production situation and lets scheduling theory more realistic. Through the reconstruction of the existing improved genetic algorithm, this paper designed an improved genetic algorithm to solve the flexible Job-Shop scheduling problem considered job movement time. Finally, by solving the enterprise case, it built Gantt chart and disjunctive graph and verified the feasibility and effectiveness of flexible Job-Shop scheduling problem model considered job movement time.
英文关键词 job movement time; flexible Job-Shop scheduling problem(FJSP); disjunctive graph; genetic algorithm
参考文献 查看稿件参考文献
  [1] Lu P H, Wu M C, Tan Hao, et al. A genetic algorithm embedded with a concise chromosome representation for distributed and flexible Job-Shop scheduling problems[J] . Journal of Intelligent Manufactu-ring, 2015:1-16.
[2] 张国辉, 聂黎, 毛学港. 生物地理学算法求解柔性作业车间调度问题[J] . 计算机应用研究, 2014, 31(4):1005-1008.
[3] Singh M R, Singh M, Mahapatra S S, et al. Particle swarm optimization algorithm embedded with maximum deviation theory for solving multi-objective flexible Job-Shop scheduling problem[J] . International Journal of Advanced Manufacturing Technology, 2016, 85(9):2353-2366.
[4] 包晓晓, 叶春明, 计磊, 等. 改进混沌烟花算法的多目标调度优化研究[J] . 计算机应用研究, 2016, 33(9):2601-2605.
[5] 黄学文, 马雪丽, 曹德弼. 工序顺序柔性的作业车间调度问题的改进遗传算法求解[J] . 运筹与管理, 2013, 22(1):65-70.
[6] 蒋增强, 左乐. 低碳策略下的多目标柔性作业车间调度[J] . 计算机集成制造系统, 2015, 21(4):1023-1031.
[7] 汪俊亮, 张洁, 秦威, 等. 加工时间不确定的柔性作业车间鲁棒调度方法[J] . 中国机械工程, 2015, 26(5):627-632.
[8] Xu Ye, Wang Ling, Wang Shengyao, et al. An effective teaching-learning-based optimization algorithm for the flexible Job-Shop scheduling problem with fuzzy processing time[J] . Neurocomputing, 2015, 148:260-268.
[9] 何之洲, 杨煜俊, 陈新度. 带搬运机器人的Job-Shop问题的并行禁忌搜索算法[J] . 工业工程, 2013, 16(4):122-125.
[10] 周炳海, 周淑美, 赵猛. 基于析取图考虑物料搬运的Job-Shop调度算法[J] . 东北大学学报:自然科学版, 2016, 37(1):138-142.
[11] Zhang Qiao, Manier H, Manier M A. A genetical gorithm with tabu search procedure for flexible Job-Shop scheduling with transportation constraints and bounded processing times[J] . Computers & Operations Research, 2012, 39(7):1713-1723.
[12] 赵宁, 李开典, 田青, 等. 考虑运输时间柔性作业车间调度问题的快速寻优方法[J] . 计算机集成制造系统, 2015, 21(3):724-732.
[13] Rossi A. Flexible Job-Shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships[J] . International Journal of Production Economics, 2014, 153(4):253-267.
[14] 张国辉, 高亮, 李培根, 等. 改进遗传算法求解柔性作业车间调度问题[J] . 机械工程学报, 2009, 45(7):145-151.
[15] 张超勇, 饶运清, 李培根, 等. 柔性作业车间调度问题的两级遗传算法[J] . 机械工程学报, 2007, 43(4):119-124.
[16] 刘琼, 张超勇, 饶运清, 等. 改进遗传算法解决柔性作业车间调度问题[J] . 工业工程与管理, 2009, 14(2):59-66.
收稿日期 2016/5/30
修回日期 2016/7/11
页码 2329-2331
中图分类号 TP391
文献标志码 A