期刊文献+

基于改进遗传算法的不确定加工时间Flow-Shop鲁棒调度

Research on Flow-shop Scheduling with Uncertain Processing Times Based on Improved Genetic Algorithm
下载PDF
导出
摘要 对不确定加工时间环境下的Flow-shop调度问题进行了研究,利用六点模糊数对不确定加工时间进行描述,以最大完工时间和最大完工时间跨度的权重和为鲁棒性测度构建模糊加工时间Flow-shop调度模型。提出了模型求解的改进遗传算法,算法采用单染色体遍历操作代替染色体交叉操作,用以增强种子代繁衍的确定性,最后仿真分析验证了算法的有效性。 Flow-shop scheduling with uncertain processing times is researched in this paper. Six-fuzzy-number is used todescribe uncertain processing times. The fuzzy processing times Flow-shop scheduling model is constructed and i t treat the weight of the maximum completion time and its time span as the robustness measure. The improved genetic algorithm ( IGA) which uses single chromosome traversal to replace chromosomal chiasma is developed to solve this model; and simulation experiment data shows the superiority of IGA in this area.
作者 杜先军
出处 《机械工程师》 2016年第9期65-67,共3页 Mechanical Engineer
  • 相关文献

参考文献8

二级参考文献62

  • 1GAREY M R, JOHNSON D S, SETHI R. The complexity of flow shop and job shop scheduling [J ]. Mathematics of Operations Research, 1976, 1 (2) : 117 - 129.
  • 2LENSTRA J K, RINNOOY Kan AHG, BRUCKER P. Complexity of machine scheduling problems [ J ]. Annal of Discrete Mathematics,1977,1(1):343-362.
  • 3CAMPBELL H G, DUDEK R A, SMITH M L. A heuristic algorithm for the n-jobs, m-machine sequencing problem [ J]. Management Science, 1970,( 16):630-637.
  • 4NAWAZ M, EMSCORE Jr E E, HAM I. A heuristic algorithm for the n-job, m-machine flow shop sequencing problems [J]. Int J of Management Science, 1983, (11 ):91 - 98.
  • 5TAILLARD E.Some efficient heuristic methods for the flow shop seqencing problem [ J ]. European J of Operational Research, 1990,(47) : 65 - 74.
  • 6OSMAN I H, POTTS C N. Simulated annealing for permulation flow shop scheduling [ J]. Int J of Managemera Science, 1989, (17) :551 -557.
  • 7KIRKPATRICK S, GELATT C D Jr, VECCHI M P. Optimization by simulated annealing [J]. Science, 1983, (220) :671 - 680.
  • 8GRABOWSKI J, SKUBALSKA E, SMUTNICKI C. On flow shop scheduling with release and due dates to minimize maximum lateness[ J]. J of Operational Research Society, 1983, (4) :615 - 620.
  • 9GRABOWSKI J, NOWICKI E, ZDRALKA S. A block approach for single-machine scheduling with release dates and due dates .European J of Operational Research, 1986, (26) :278 - 285.
  • 10TAILLARD E. Benchmark for basic scheduling problems [J]. European J of Operational Research, 1993, (64) :278 - 285.

共引文献47

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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