期刊文献+

JIT柔性混合流水车间生产调度问题研究 被引量:1

JIT-based Flexible Hybrid Flow Shop Production Scheduling Research
下载PDF
导出
摘要 针对混合柔性流水车间多种工艺路线的生产调度问题,分析了生产工艺计划与车间调度系统的集成原理,建立目标模型,通过将简单遗传算法加以改进,在建立集成模型的基础上,对算法进行研究,把进化后的遗传算法(SGA)和改进的模拟退火算法(SA)有机结合,使算法优化机制融合和优化结构互补,形成较为高效的混合优化算法,并对问题进行求解。最后给出了一个具体算例,验证算法的有效性和先进性。 For a variety of hybrid flexible flow- shop process route of the problem of production scheduling,analysis of production process planning and shop scheduling system integration principle, set up the target model, by a simple genetic algorithm to improve, in the integrated model set up based on the algorithm research, put the post -evolutionary genetic algorithm (SGA) and improved simulated annealing algorithm (SA) an organic combination of algorithm optimization mechanism to enable the integration and optimization of the structure complement each other to form a more efficient hybrid optimization algorithm, and to solve the problem. Finally give a specific example, verify the effectiveness of the algorithm and the advanced nature.
出处 《机械与电子》 2009年第10期61-64,共4页 Machinery & Electronics
基金 科技部攻关资助项目(06C26216201853) 甘肃省教育厅导师资助项目(0703-06) 甘肃省自然科学基金资助项目
关键词 柔性 准时制 混合流水车间 生产调 遗传算法 模拟退火算法 flexible JIT hybrid flowshop production scheduling improved genetic algorithm simulated annealing algorithm
  • 相关文献

参考文献10

  • 1Salvador M S. A solution to a special case of flow shop scheduling problems [J].European Journal of Operational Research, 2001,132 : 528-- 538.
  • 2Hoogeveen J A, Lenstra J K, Veltman B. Minimizing the makespanin a multi processor flowshop is strongly NP- hard[J]. European Journal of Operational Research(to appear), 2006,33 (5) : 1399 -- 1419.
  • 3Gupta J N D. Two - stage hybrid flowshop scheduling problem[J]. Journal of Operational Research Society, 1988,344:359--364.
  • 4Artbanari I S, Ramamurthy K G. An extension of two mac hines sequencing problem[J].Opsearch, 19 71, (8) : 10--11.
  • 5Hunsueker J L,Brah S A,Santos D L. Simulation study of a flow shop with multiple processors scheduling [C]. TIMS/ORSA Joint National Meeting in New York City, October, 1989.
  • 6Brah S A, Loo L L. Heuristics for scheduling in a flowshop with multiple processors[J]. European Journal of Operational Research, 1999,11(3) : 113-- 122.
  • 7Kim M,Jung J H,L ee I B. Intelligent scheduling and monitoring for multi - product networked batch processes [J]. European Symposium on Computer Aided Process Engineering, 1996,6B: 1149-- 1154.
  • 8Rajendran C,Chaudhuri D. A multistage parallel processor flow shop problem with minimum flowtime[J]. European Journal of Operational Research, 1992, 57: 111--122.
  • 9Brah S A, Hunsucker J L. Branch and bound algorithm for the f-lowshop with multiple processors. European Journal of Operational Research, 1991,51:88--99.
  • 10Portmann M C, Vignier A, Dardilhac D, Dezalay D. Branch and bound crossed with GA to solve hybrid flowshops[J]. European Journal of Operational Re- search,1998,10(7) :389--400.

同被引文献4

引证文献1

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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