期刊文献+

具有时间窗约束的柔性流水车间设备利用率排产优化问题研究

Researching on flexibility flow shop equipment utilization rate problem
下载PDF
导出
摘要 针对具有时间窗约束的柔性流水车间的设备利用率优化问题,本文提出一种基于信息熵的自适应CGA算法求解该问题,构建了具有时间窗约束的柔性流水车间生产调度模型,全局优化过程采用自适应CGA优化算法,同时优化上线序和并行工位分配,在局部优化过程中采用时间窗约束控制工件开工时间,实现提高设备利用率,优化生产资源的目的。基于2组仿真方案分析论证,证明了采用改进自适应CGA算法解决柔性流水车间设备利用率优化问题的有效性。 Aiming to flexibility flow shop equipment utilization rate problem with time window constraint(FFSEUP-TWC),proposed a self-adaptation CGA algorithm(SACGA)based on information entropy,and constructed a flexibility flow shop production scheduling model with time window constraint.Using self-adapting CGA algorithm as global optimization method,optimize the on-line order and distribution of parallel machine at the same time,using time window constrain too control the starting time for each job in partial optimization to improve equipment utilization and optimize production resource.The analysis of several schemes numerical calculation results demonstrate the effectiveness of self-adaptive CGA algorithm while dealing with flexibility flow shop equipment utilization rate problem.
作者 董晓婷 DONG Xiao-ting(Sichuan College of Architectural Technology Equipment Engineering Department,Deyang Sichuan 61800,China)
出处 《科技视界》 2018年第29期212-213,共2页 Science & Technology Vision
关键词 柔性流水车间 设备利用率 时间窗 SACGA算法 Flexibility flow shop Equipment utilization rate Time window constraint Self-adaptation CGA algorithm
  • 相关文献

参考文献2

二级参考文献27

  • 1常俊林,邵惠鹤.两机零等待流水车间调度问题的启发式算法[J].计算机集成制造系统,2005,11(8):1147-1153. 被引量:9
  • 2周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 3钟润添,龚海峰,李斌,庄镇泉.一种多目标优化的多概率模型分布估计算法[J].计算机仿真,2007,24(4):180-182. 被引量:6
  • 4Liaw C F. An Efficient Simple Metaheuristic for Minimizing the Makespan in Two--machine No-wait Job Shops [J].Computers & Operations Research, 2008, 35(10) :3276-3283.
  • 5Bouquard J L. Two--machine Flow Shop Scheduling Problems with No--wait Jobs[J]. Operations Research Letters, 2005, 33(3): 255-262.
  • 6Koulamas C, Kyparisis J. The Three--stage As sembly Flow Shop Scheduling Problem[J]. Computers & Operations Research, 2001, 28(7) :689- 704.
  • 7Aldowaisan T, Allahverdi A. New Heuristics for No--wait Flowshops to Minimize Makespan[J]. Computers & Operations Research, 2003, 30(8):1219-1231.
  • 8Aldowaisan T, Allahverdi A. New Heuristics for M-machine No--wait Flow Shop to Minimize Total Completion Time[J].The International Journal of Management Science, 2004, 32(5):345-352.
  • 9Grabowski J, Pempera J. Some Local Search Algorithm Search for Nowait Flow--shop Problem with Makespan Criterion[J]. Compmers & Operations Research, 2005, 32(8) :2197-2212.
  • 10Dileepan P. A Note on Minimizing Maximum Lateness in a Two--machine No--wait Ftowshop[J].Computers in Operations Research, 2004 (31) 2111-2115.

共引文献74

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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