计算机应用与软件2011，Vol.28Issue(5)：94-97,4.
基于粒子群优化和禁忌搜索的混合调度算法
HYBRID SCHEDULING HEURISTICS BASED ON PARTICLE SWARM OPTIMISATION AND TABU SEARCH
摘要
Abstract
A discrete particle swarm optimisation (PS0) algorithm is presented for Job Shop Scheduling problem. In the algorithm, a preference list-based representation code and update model for new positions are applied so as to make the PSO with incessant nature straight suitable for the Job Shop Scheduling problem. Based on excellent whole search ability of PSO and self-adaptive merit of Tabu Search (TS), two hybrid procedures, named GPS0 and PTS, are put forward by combining PSO and TS. Experimental results demonstrate that within the framework of two newly designed hybrid algorithms, the Job Shop Scheduling problem can be solved efficiently with high quality.关键词
作业车间调度问题/粒子群优化/禁忌搜索/混合算法Key words
Job shop scheduling problem/ Particle swarm optimisation/ Tabu search/ Hybrid heuristics引用本文复制引用
管显笋,石伟铂,邓成玉,刘永山..基于粒子群优化和禁忌搜索的混合调度算法[J].计算机应用与软件,2011,28(5):94-97,4.基金项目
工信部2008电子信息产业发展基金(工信部运[2008]97号). （工信部运[2008]97号）
