摘要
首先分析了典型调度算法用于解决作业车间调度问题(JSSP)时的不足;然后叙述了作业车间调度问题和粒子群优化算法的原理和数学模型,并引入自适应策略来改进粒子群优化算法;最后通过计算作业车间调度问题的标准算例,验证了改进后算法的有效性。
Firstly,the shortcomings of typical scheduling algorithm for solving job shop scheduling problem(JSSP)are analyzed.Then the principle and mathematical model of job shop scheduling problem and particle swarm optimization algorithm are described,and adaptive strategy is introduced to improve particle swarm optimization algorithm.Finally,the effectiveness of the improved algorithm is verified by a JSSP benchmark problem.
作者
杨恒
Yang Heng(School of Mechanical Engineering and Automation,Fuzhou University,Fujian Fuzhou,350116,China)
出处
《机械设计与制造工程》
2019年第2期73-76,共4页
Machine Design and Manufacturing Engineering
关键词
作业车间调度问题
粒子群优化算法
自适应策略
job shop scheduling problem
partical swarm optimization
adaptive strategy
