期刊文献+

解决无等待流水线调度问题的新算法 被引量:4

Three Novel Algorithms for No-wait Flow Shop Scheduling
下载PDF
导出
摘要 提出了解决无等待流水线调度问题的3种新算法,即离散粒子群优化算法、离散差异进化算法和阈值接收算法。离散粒子群优化算法和离散差异进化算法采用了基于工件序列的编码方式和新的个体生成方法,从而使具有连续性质的粒子群优化算法和差异进化算法能直接用于求解调度问题。仿真试验表明了上述算法的有效性。 Three novel algorithms of discrete particle swarm optimization (DPSO) , discrete differential evolution (DDE) and threshold acceptance (TA) are proposed for solving no-wait flow shop problems. Both DPSO and DDE, which can be applied to all classes of combinational optimization problems, adopt an encoding scheme based on job permutation and a new method of individual production, thus solving scheduling problems directly. TA produces slightly better results for makespan criteria. Simulation results show the effectiveness of the above algorithms.
出处 《机械科学与技术》 CSCD 北大核心 2006年第12期1487-1490,共4页 Mechanical Science and Technology for Aerospace Engineering
基金 国家自然科学基金项目(50275078) 山东省自然科学基金项目(2004ZX14 2004ZX17)资助
关键词 无等待流水线调度 离散粒子群优化算法 差异进化算法 阚值接收算法 no-wait flow shop scheduling discrete particle swarm optimization algorithm discrete differential evolution threshold acceptance algorithm
  • 相关文献

参考文献8

  • 1Pan 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
  • 2潘全科,朱剑英.基于进化算法和模拟退火算法的混合调度算法[J].机械工程学报,2005,41(6):224-227. 被引量:21
  • 3Pan 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
  • 4潘全科,王文宏,潘群,朱剑英.解决JOB SHOP问题的粒子群优化算法[J].机械科学与技术,2006,25(6):675-679. 被引量:10
  • 5潘全科,王文宏,朱剑英.一类解决车间调度问题的遗传退火算法[J].机械科学与技术,2006,25(3):317-321. 被引量:6
  • 6潘全科,王文宏,朱剑英.基于粒子群优化和模拟退火的混合调度算法[J].中国机械工程,2006,17(10):1044-1046. 被引量:17
  • 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

二级参考文献34

  • 1潘全科,朱剑英.基于进化算法和模拟退火算法的混合调度算法[J].机械工程学报,2005,41(6):224-227. 被引量:21
  • 2Chu C, Proth J M, Wang C. Improving job-shop schedules through critical pairwise exchanges. International Journal of Production Research, 1998, 36(3): 683-694.
  • 3Nowicki E, Smutnicki C. A fast taboo search algorithm for the job shop scheduling. Management Science, 1996, 42(6):797-813.
  • 4Shi G Y. A genetic algorithm applied to a classic job-shop scheduling problem. International Journal of Systems Science, 1997, 28(1): 25-32.
  • 5Laarhoven P V, Aarts E, Lenstra J K. Job shop scheduling by simulated anncaling. Operations Research, 1992, 40:113-125.
  • 6Corce F D, Tadei R, Volta G. A genetic algorithm for the job shop problem. Computers and Operations Research, 1995,22:15-24.
  • 7Amico M D, Trubian M. Applying tabu search to the job shop scheduling problems. Annual Operations Research,1993, 40:231-252.
  • 8Cheng R,Gen M,Tsujimura Y.A tutorial survey of job-shop scheduling problems using genetic algorithms,part Ⅱ:hybrid genetic search strategies [J].Computers & Industrial Engineering,1999,33:343~364
  • 9Wang W,Brunn P.An effective algorithm for job shop scheduling[J].Proc.Instn.Mech.Engrs.,1999,214(B):293~300
  • 10Shi G Y.A genetic algorithm applied to a classic job-shop scheduling problem [J].International Journal of Systems Science,1997,28 (1):25~32

共引文献47

同被引文献15

  • 1陈守家,付霞,周欣.基于遗传禁忌算法结合解决排课问题[J].计算机应用,2007,27(7):1806-1808. 被引量:16
  • 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.
  • 5Robert G. Reynolds. An Introduction to Cultural Algorithms [ C] //Proc. 3rd Annual Conference on Evolutionary Programming, River Edge, NJ World Scientific, 1994 : 131-139.
  • 6Daniel 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.
  • 7Nhu 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.
  • 8T Hastie, R Tibshirani, J Friedman. The Elements of Statistical Learning [ M ]. New York : Springer,2001.
  • 9Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan [ J ]. Journal of the Operational Research Society, 1994,45 (4) : 472-478.
  • 10玄光男 程润伟.遗传算法与工程设计[M].北京:科学出版社,2000..

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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