首页 | 官方网站   微博 | 高级检索  
     

求解Job shop的一种快速混合算法
引用本文:李俊青,潘全科,王玉亭,谢圣献,何顺刚. 求解Job shop的一种快速混合算法[J]. 微电子学与计算机, 2010, 27(1)
作者姓名:李俊青  潘全科  王玉亭  谢圣献  何顺刚
作者单位:1. 聊城大学,计算学院,山东,聊城,252059
2. 聊城市信息产业局,山东,聊城,252000
摘    要:结合车间调度问题本身的特点,采用关键路径块邻域结构,混合禁忌搜索算法和粒子群优化算法,设计了一种快速混合调度算法.该算法对预选择的块邻域解的性能进行快速估计,对不可行解尽早舍去,大大减小了邻域解的搜索空间.仿真结果表明,该算法在求解平均时间和性能方面均具备明显优势.

关 键 词:车间调度问题  禁忌搜索算法  块结构  粒子群优化

A Fast Hybrid Algorithm for Job Shop Scheduling Problems
LI Jun-qing,PAN Quan-ke,WANG Yu-ting,XIE Sheng-xian,HE Shun-gang. A Fast Hybrid Algorithm for Job Shop Scheduling Problems[J]. Microelectronics & Computer, 2010, 27(1)
Authors:LI Jun-qing  PAN Quan-ke  WANG Yu-ting  XIE Sheng-xian  HE Shun-gang
Abstract:The paper designed a fast hybrid algorithm for the job shop scheduling problems. The feature of the job shop scheduling problem was considered, and block neighbor solutions based on critical path was used in it, tabu search algo-rithm and particle swarm optimization were all included in it. A new function was created to quickly estimate the perfor-mance of the candidate solutions, and drop the bad ones, so it can decrease the search space deeply. A simulation indicates that the new algorithm has good effieieney and performance.
Keywords:job shop problem  tabu search algorithm (TSA)  block structure  particle swarm optimization (PSO)
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号