期刊文献+

一种有到达时间的多处理器混合流水车间调度的遗传算法(英文) 被引量:1

A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessors and Release Dates
下载PDF
导出
摘要 有到达时间的多处理器混合流水车间调度问题在实时机器视觉系统等领域有广泛的应用。这一问题是NP-困难的。鉴于以上原因,给出一种遗传算法。对不同的交叉算子和变异算子以及涉及的参数的不同取值进行试验,并对试验的结果进行分析和讨论,从而给出最好的参数组合。 The hybrid flow-shop scheduling problem with multiprocessors and release dates may find its applications in real-time machine-vision systems among others. This problem is well known as NP-hard. Motivated by the above reasons, a genetic algorithm has been proposed in this work. The algorithm by trying different crossover operators and mutation operators along with different settings of the involved parameters have been implemented. The experiment results and concluded the best settings have been analyzed and discussed at last.
出处 《计算机与数字工程》 2008年第10期5-11,24,共8页 Computer & Digital Engineering
基金 国家自然科学基金(编号:60603007)资助 山东省自然科学基金项目(编号:Q2006G01)资助
关键词 多处理器调度 混合流水车间 遗传算法 到达时间 multiprocessor scheduling, hybrid flow-shop, genetic algorithm, release date
  • 相关文献

参考文献10

  • 1Caraffa, V., S. Ianes, T. P. Bagchi, C. Srishadarajah. Minimizing makespan in a blocking flowshop using genetic algorithms[J]. International Journal Production Economics, 2001, 70:101-115 被引量:1
  • 2Ceyda O, M. Fikret Ercan. A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks [J]. Journal of Scheduling, 2005, (8):323-351 被引量:1
  • 3Chen, C. L., V. S. Vempati, and N. Aljaber. An application of genetic algorithms for flwo shop problems [J]. European Journal of Operational Research, 1995, 80: 389-396 被引量:1
  • 4Gen,M. , R. Cheng. Genetic Algorithms and Engineering Design[M]. New York: Wiley, 1997 被引量:1
  • 5Goldberg, D., R. Lingle. Alleles, loci, and the traveling salesman problem [C]. Proceedings of the First International Conference on Genetic Algorithms and their Applications (J. Grefenstette (ed.)), Hillsdale, 1985 : 154-159 被引量:1
  • 6Gupta, J. N. D.. Two stage hybrid flowshop scheduling problem [J]. Journal of Operational Research Society, 1988, 39(4): 359-364 被引量:1
  • 7Iyer, S. K. ,B. Saxena. Improved genetic algorithm for the permutation flowshop scheduling problem[J]. Computers and Operations Research, 2004, (31):593-606 被引量:1
  • 8Lloyd, E. L.. Concurrent task systems[J]. Operations Research, 1981, (29) : 1894201 被引量:1
  • 9Michalewicz, Z.. Genetic Algorithms + Data Structures = Evolution Programs (3rd edition) [M]. Berlin: Springer-Verlag, 1996 被引量:1
  • 10Reeves, C. R.. A genetic algorithm for flowshop sequencing[J]. Computers and Operations Research, 1995, 22:5-13 被引量:1

同被引文献6

  • 1周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:210
  • 2Misuo Gen, Runwei Cheng. Genetic Algorithms and Engineering Design[M]. John Wiley & Sons Inc, 1997. 被引量:1
  • 3Muhlenbein H. Paaβ G. From recombination of genes to the estimation of distributioru Binary parameters[J]. In: Lecture notes in computer science 1411: par- allel problem solving from nature, PPSN, 1996 Ⅳ:178 -187. 被引量:1
  • 4Larraanaga, P. , Lozano, J. A. , (Eds). Estimation of Distribution Algorithms: a new tool for evolutionary computation 2002 [ M ]. Boston/Dordrecht/London: klower Academic publishers, 2002. 被引量:1
  • 5Lozano JA, et al. Towards a New Evolutionary Com- puter Advances on Estimation of Distribution Algo- rithms[M]. Berlin: Springer,1996. 被引量:1
  • 6Taillard E. Benchmarks for basic scheduling problems [J]. European Journal of Operational Research, 1993, 64 : 278-285. 被引量:1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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