期刊文献+

带有学习效应的多目标置换流水车间调度问题研究 被引量:1

Research on Multi-objective Permutation Flow-shop Scheduling Problem with Learning Effect
下载PDF
导出
摘要 在综合考虑经济指标和环境因素的基础上,提出了以最小化最大完工时间和总能耗为优化目标的置换流水车间调度问题,并着重考虑学习效应对该问题的影响。针对该问题的特点,构建了带有学习效应的多目标置换流水车间调度模型,并设计了一种嵌有批量处理和扰动算子操作的混合蛙跳算法对模型进行求解。利用扩展的标准测试问题验证了该算法的性能,并与非支配排序遗传算法、强帕累托进化算法进行了对比分析,实验结果表明改进的混合蛙跳算法具有较好的寻优能力。利用此算法得到了不同学习率下的优化目标值,并运用敏感性分析探讨了学习效应对优化目标的影响程度,从而为企业制定合理的生产调度方案提供参考。 Based on comprehensive consideration of economic indicators and environmental factors,a permutation flow-shop scheduling problem with optimization goals of minimizing maximum completion time and total energy consumption is proposed,and the impact of learning effects on this problem is considered.Aiming at the characteristics of this problem,a multi-objective permutation flow shop scheduling model with learning effects was constructed,and a hybrid frog-leaping algorithm with batch processing and perturbation operator operations was designed to solve the model.The performance of the algorithm is verified using extended standard test questions,and compared with non-dominated sorting genetic algorithm and strong Pareto evolution algorithm.The experimental results show that the improved hybrid frog jumping algorithm has better optimization ability.Using this algorithm,the optimization target values under different learning rates are obtained,and the sensitivity analysis is used to explore the impact of learning effects on the optimization goals,so as to provide a reference for companies to formulate a reasonable production scheduling plan.
作者 张洪亮 张金春 盖海江 ZHANG Hongliang;ZHANG Jinchun;GE Haijiang(School of Management Science and Engineering,Anhui University of Technology,Ma'anshan,Anhui 243032,China)
出处 《南华大学学报(自然科学版)》 2020年第5期77-86,共10页 Journal of University of South China:Science and Technology
基金 国家自然科学基金面上项目(71772002) 安徽省高校人文社科重点项目(SK2019A0060)。
关键词 置换流水车间 学习效应 改进的混合蛙跳算法 最大完工时间 总能耗 permutation flow-shop scheduling learning effects improved shuffled leapfrog algorithm maximum completion time the total energy consumption
  • 相关文献

参考文献13

二级参考文献136

  • 1曹华军,刘飞,阎春平,李聪波.制造过程环境影响评价方法及其应用[J].机械工程学报,2005,41(6):163-167. 被引量:33
  • 2Garey E L, Johnson D S, Sethi R. The complexity of flow-shop and job-shop scheduling [J]. Mathematics of Operations Research (S0364-765X), 1976, 1(1): 117-129. 被引量:1
  • 3Johnson S. Optimal two-and three-stage production schedules with setup times included [J]. Naval Research Logistics (S0894-069X), 1954, Quarterly, 1(1): 61. 被引量:1
  • 4Jatinder N D Gupta, Edward F Stafford Jr. Flowshop scheduling research after five decades [J]. European Journal of Operational Research (S0377-2217), 2006, 169(3): 699-711. 被引量:1
  • 5Rub6n Ruiz, Concebci6n Maroto. A comprehensive review and evaluation of permutation flowshop heuristics [J]. European Journal of Operational Research (S0377-2217), 2005, 165(2): 479-494. 被引量:1
  • 6B J Lageweg, J K Lenstra, A H G Rinnooy Kan. A general bounding scheme for the permutation flow-shop problem [J]. Operation Research (S0030-364X), 1978, 26(1): 53-67. 被引量:1
  • 7Nawaz M, E Enscore, I Ham. A heuristic algorithm for the m-machine n-job flow shop sequencing problem [J]. OMEGA (S0305-0483), 1983, 11(1): 11-95. 被引量:1
  • 8Taillard E. Some efficient heuristic methods for flow-shop sequencing [J]. European Journal of Operational Research (S0377-2217), 1990, 47(1 ): 65-74. 被引量:1
  • 9Nowocki E, Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem [J]. European Journal of Operational Research (S0377-2217), 1996, 91(1): 160-175. 被引量:1
  • 10Osman I, Ports C. Simulated annealing for permutation flow-shop scheduling [J]. OMEGA (S0305-0483), 1989, 17(6): 551-557. 被引量:1

共引文献127

同被引文献6

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部