计算机集成制造系统 ›› 2016, Vol. 22 ›› Issue (第10期): 2348-2354.DOI: 10.13196/j.cims.2016.10.008

• 产品创新开发技术 • 上一篇    下一篇

基于排队网模型的柔性流水车间缓冲区容量优化

李翔1,2,陈庆新1,俞爱林1+,张惠煜1   

  1. 1.广东工业大学广东省计算机集成制造重点实验室
    2.湘南学院电子信息与电气工程学院
  • 出版日期:2016-10-31 发布日期:2016-10-31
  • 基金资助:
    国家自然科学基金资助项目(51375098,61573109,71572049,71402033);广东省自然科学基金博士启动资助项目(2014A030310313);湖南省高校科技创新团队支持计划联合资助项目。

Buffer allocation optimization of flexible flow shop based on queuing network model

  • Online:2016-10-31 Published:2016-10-31
  • Supported by:
    Project supported by the National Natural Science Foundation,China(No.51375098,61573109,71572049,71402033),the PhD Start-up Fund of Natural Science Foundation of Guangdong Province,China(No.2014A030310313),and the Aid Program for Science and Technology Innovative Research Team in Higher Educational Institutions of Hunan Province,China.

摘要: 针对订货型单类型工件柔性流水车间缓冲区容量优化设置问题,在考虑各级工序节点之间耦合关系的前提下,基于连续时间马尔可夫随机过程原理建立了多级柔性流水车间的排队网节点状态模型。在给出系统产出率为目标和平均生产周期条件约束的情形下,利用该模型计算系统的关键性能指标,提出一种针对柔性流水车间特点的缓冲区容量优化分支定界算法。通过该算法计算算例并与Em-plant工具仿真结果进行对比分析,最终确定了合理的柔性流水车间缓冲区容量。

关键词: 排队网, 连续时间马尔可夫链, 缓冲区设置, 分支定界算法

Abstract: Due to the buffer capacity problem of flexible flow shop,based on continuous-time Markov stochastic process theory,a queuing network node state model which considered the coupling relationship between processes nodes at all levels was established.With the given output rate and average makespan constraint,a modified branch and bound algorithm was designed to solve the problem of buffer allocation optimization for the flexible flow shop by using the key performance indicators of the proposed model's calculate system.Through The reasonable buffer capacity of flexible flow shop was determined through the results of examples which calculated by the algorithm and compared with the simulation results of Em-plant tools.

Key words: queuing network, continuous-time Markov chain, buffer allocation problem, branch-and-bound algorithm

中图分类号: