期刊文献+

基于文化算法的无等待Flowshop调度

Scheduling of No-wait Flowshop by Using Culture Algorithm
下载PDF
导出
摘要 针对目标函数为最小化最大完工时间的无等待流水车间调度问题,提出了基于文化算法思想的混合遗传算法。该算法利用文化算法的知识记忆思想进行解群体的控制,构造了两个记忆器来实现这一功能,在迭代过程中继承上一代中较优解的特性,提高了搜索效率和搜索质量。算例实验证明了该算法的有效性。 Adopting the idea of knowledge memory in the culture algorithm, the proposed hybrid genetic algorithm builds two memory devices to control the populations. Thus, the advantages of the parents can be inherited during the iterations. The experimental results demonstrate that the algorithm performance is improved.
出处 《工业工程》 北大核心 2009年第3期75-78,共4页 Industrial Engineering Journal
基金 河北省教育厅自然科学基金资助项目(2008207) 河北省教育厅社会科学基金资助项目(S080206) 2009年度河北省社会科学发展研究课题(200905005) 秦皇岛市科学技术研究与发展计划项目(200901A334)
关键词 文化算法 遗传算法 无等待流水车间 调度 culture algorithm genetic algorithm no-wait flowshop scheduling
  • 相关文献

参考文献10

  • 1玄光男 程润伟.遗传算法与工程设计[M].北京:科学出版社,2000..
  • 2Nawaz M, Enscore E, Ham I. A Heuristic algorithm for the mmachine, n-job flow-shop sequencing problem [ J ]. The International Journal of Management Science, 1983,11 ( 1 ) :91- 95.
  • 3Aldowaisan T, Allahverdi A. New heuristics for no-wait flowshops to minimize makespan [ J ]. Computers and Operations Research ,2003,30( 8 ) : 1219-1231.
  • 4Schuster C J, Framinan JM. Approximative procedures for nowait job shop scheduling. Operations Research Letters,2003, 31 (4) :308-318.
  • 5潘全科,谢圣献,张亚卿,朱剑英.解决无等待流水线调度问题的新算法[J].机械科学与技术,2006,25(12):1487-1490. 被引量:4
  • 6Robert G. Reynolds. An Introduction to Cultural Algorithms [ C] //Proc. 3rd Annual Conference on Evolutionary Programming, River Edge, NJ World Scientific, 1994 : 131-139.
  • 7Daniel Cortes Rivera, Ricardo Landa Becerra, Carlos A, Coello. Cultural algorithms, an alternative heuristic to solve the job shop scheduling problem [ J ]. Engineering Optimization, 2007,39( 1 ) : 69-85.
  • 8Nhu Binh Ho, Joc Cing Tay and Edmund M.-K. Lai. An effective architecture for learning and evolving flexible job-shop schedules [ J ]. European Journal of Operational Research, 2007,179(2) :316-333.
  • 9T Hastie, R Tibshirani, J Friedman. The Elements of Statistical Learning [ M ]. New York : Springer,2001.
  • 10Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan [ J ]. Journal of the Operational Research Society, 1994,45 (4) : 472-478.

二级参考文献8

  • 1潘全科,朱剑英.基于进化算法和模拟退火算法的混合调度算法[J].机械工程学报,2005,41(6):224-227. 被引量:21
  • 2潘全科,王文宏,朱剑英.一类解决车间调度问题的遗传退火算法[J].机械科学与技术,2006,25(3):317-321. 被引量:6
  • 3潘全科,王文宏,朱剑英.基于粒子群优化和模拟退火的混合调度算法[J].中国机械工程,2006,17(10):1044-1046. 被引量:17
  • 4潘全科,王文宏,潘群,朱剑英.解决JOB SHOP问题的粒子群优化算法[J].机械科学与技术,2006,25(6):675-679. 被引量:10
  • 5Pan Q K,Tasgetiren M F,Liang Y C.A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion[A].Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group[C],UK PLANSIG2005.City University,London,2005,31~41
  • 6Pan Q K,Tasgetiren M F,Liang Y C.Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm[J].Lecture Notes in Computer Science,2006,4150:460~467
  • 7Grabowski J,Pempera J.Some local search algorithms for no-wait flow-shop problem with makespan criterion[J].Computers & Operations Research,2005,32:2197~2122
  • 8Schuster C J,Framinan J M.Approximative procedures for no-wait job shop scheduling[J].Operations Research Letters,2003,31:308~318

共引文献295

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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