• 论文 •    

解决无等待流水车间调度问题的离散粒子群优化算法

潘全科,王文宏,朱剑英   

  1. 1.聊城大学 计算学院,山东聊城252059;2.南京航空航天大学 机电学院,江苏南京210016
  • 出版日期:2007-06-15 发布日期:2007-06-25

Modified discrete particle swarm optimization algorithm for nowait flow shop problem

PAN Quanke,WANG Wenhong, ZHU Jianying   

  1. 1.College of Computer Science, Liaocheng University, Liaocheng252059, China; 2.School of Mechatronics Engineering, Nanjing University of Aeronautics & Astronautics, Nanjing210016, China
  • Online:2007-06-15 Published:2007-06-25

摘要: 针对以生产周期为目标的无等待流水车间调度问题,提出了一种离散粒子群优化算法。研究了无等待流水车间调度问题的快速邻域搜索技术,并将其分别用于加强粒子、个体极值或全体极值的邻域探索能力,得到了三种改进的离散粒子群优化算法。基于典型算例的试验,表明了上述算法的有效性。

关键词: 无等待流水车间调度问题, 粒子群优化算法, 邻域搜索, 生产周期

Abstract: A Discrete Particle Swarm Optimization (DPSO) algorithm was proposed for nowait flow shop scheduling problem with makespan criterion. Then a fast neighborhood search algorithm was presented. To improve DPSO algorithm, three heuristicsDPSO1, DPSO2 and DPSO3were implemented by combing with the fast neighborhood search algorithm. Computational results based on the well known benchmark suites in the literature showed that all the heuristics were effective and feasible in finding optimum or nearoptimal solutions.

Key words: nowait flow shop scheduling problem, particle swarm optimization algorithm, neighborhood search, makespan

中图分类号: