计算机工程与应用 ›› 2013, Vol. 49 ›› Issue (21): 15-18.

• 博士论坛 • 上一篇    下一篇

求解柔性作业调度问题的协同进化粒子群算法

宋存利   

  1. 大连交通大学,辽宁 大连 116028
  • 出版日期:2013-11-01 发布日期:2013-10-30

Co-evolution Particle Swarm Optimization algorithm for flexible job-shop scheduling problem

SONG Cunli   

  1. Dalian Jiaotong University, Dalian, Liaoning 116028, China
  • Online:2013-11-01 Published:2013-10-30

摘要: 柔性作业车间调度问题是典型的NP难题。柔性作业车间调度问题涉及到设备分配和作业分配两个问题,并且两问题之间具有较强的耦合性,提出了基于协同进化的粒子群算法。该算法将设备选择和工件调度分别作为两个寻优变量,利用PSO算法分别进行寻优,根据两个变量的内容进行互相评价。实验表明该算法对FJSP问题的有效性。

关键词: 粒子群算法, 柔性车间作业调度问题, 最小化完工时间, 邻域搜索

Abstract: The flexible job shop scheduling problem is a typical NP-hard problem. This problem involves two problems, such as equipment allocation and job assignment, and these two problems have strong couplings. To solve this problem a co-evolution Particle Swarm Optimization algorithm is proposed. The algorithm solves the equipment allocation and job assignment as two optimization variables, optimized respectively and evaluated mutually according to the contents of them. The experiments show the algorithm has obvious advantage on FJSP problem.

Key words: Particle Swarm Optimization(PSO) algorithm, flexible job shop scheduling problem, makespan, neighborhood search