期刊文献+

考虑工人负荷的多目标流水车间优化调度 被引量:5

Multi-objective flow shop optimal scheduling considering worker′s load
原文传递
导出
摘要 针对流水车间工人负荷不平衡的现象,构建了工件总延误时间和工人作业分配标准差最小化的双目标优化调度模型。设计了基于两段式染色体编码的NSGA-Ⅱ算法,获得了模型的Pareto最优解集。引入两种嵌入启发式规则:交货期最接近(EDD)规则和加工时间最短(SPT)规则,形成了NSGA-Ⅱ-EDD和NSGA-Ⅱ-SPT两种对比情境。算例分析表明:NSGA-Ⅱ算法的Pareto解的平均个数N、Pareto前沿解误差比ER、Pareto前沿解空间评价指标S、Pareto前沿跨度K比NSGA-Ⅱ-EDD和NSGA-Ⅱ-SPT的性能好,在算法运算时间T上性能较差。 To solve the problem of workers’load imbalance in the flow shop scheduling,a dual-objective optimization scheduling model is proposed in this paper with the minimum delay time and the workers’workload standard deviation.A NSGA-Ⅱbased on two-gene chromosome coding is designed to obtain Pareto-optimal solutions.Two embedded heuristic rules,the earliest due date(EDD)rule and the shortest processing time(SPT)rule,are introduced together with NSGA-Ⅱto form the NSGA-Ⅱ-EDD and NSGA-Ⅱ-SPT for comparison.Computation experimental analysis shows that NSGA-Ⅱperforms better in case of evaluation indexes with the average non-dominated solutions N,error ratio ER,spacing evaluation index S and Pareto front span K,but is worse in operation time T.
作者 孙宝凤 任欣欣 郑再思 李国一 SUN Bao-feng;REN Xin-xin;ZHENG Zai-si;Li Guo-yi(College of Transportation,Jilin University Changchun 130022,China;Department of Product,FAW-Volkswagen Auntomobile Co.,Ltd.,Changchun 130011,China)
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2021年第3期900-909,共10页 Journal of Jilin University:Engineering and Technology Edition
基金 国家自然科学基金项目(61873109,51308249) 吉林省交通运输科技项目(20160112)。
关键词 计算机应用 流水车间调度 多目标优化 工人负荷 两段式染色体编码 NSGA-Ⅱ算法 computer application flow shop scheduling multi-objective optimization worker’s load two-gene chromosome coding NSGA-Ⅱalgorithm
  • 相关文献

参考文献3

二级参考文献18

  • 1何琨,赵勇.网格环境下资源调度问题的统一建模与分析[J].华中科技大学学报(自然科学版),2006,34(3):35-38. 被引量:10
  • 2周炳海,蒋舒宇,王世进,吴斌,奚立峰.集成生产与预防性维护的流水线车间调度算法[J].大连海事大学学报,2007,33(3):32-35. 被引量:15
  • 3Safari E, Sadjadi S. A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown. Expert Systems with Applications, 2011, 38(3): 2020-2029.
  • 4Lee C Y. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters, 1997, 20(3): 129-139.
  • 5Vahedi-Nouri B, Fattahi P, Ramezanian R. Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints. Journal of Manufacturing Systems 2013, 32(1): 167-173.
  • 6Ramezanian R, Saidi-Mehrabad M, Fattahi P. MIP formulation and heuristics for multi-stage capacitated lot-sizing and scheduling problem with availability constraints. Journal of Manufacturing Systems 2013, 32(2): 392-401.
  • 7Khelifati S L, Benbouzid-Sitayeb F. A multi-agent scheduling approach for the joint scheduling of jobs and maintenance operations in the flow shop sequencing problem. Computational Collective Intelligence. Technologies and Applications. Berlin: Springer Berlin Heidelberg, 2011, 6923: 60-69.
  • 8Allahverdi A, Mittenthal J. Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function. European Journal of Operational Research, 1995, 81(2): 376-387.
  • 9Zandieh M, Gholami M. An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research 2009, 47(24): 6999-7027.
  • 10Sarker R, Omar M, Kamrul Hasan S M, Essam D. Hybrid evolutionary algorithm for job scheduling under machine maintenance. Applied Soft Computing, 2013, 13(3): 1440-1447.

共引文献14

同被引文献36

引证文献5

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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