摘要
通过对车间调度问题的描述,针对传统调度算法寻优效率低或全局寻优能力差的弱点,提出了一种基于粒子群算法(PSO)的车间调度问题解决方案.根据车间调度问题的特点,对粒子群的编码及寻优操作进行了研究,确定了更适合车间调度问题的编码和操作方式,并将算法进行编程,应用到了系统的车间调度部分.仿真结果表明,通过设置适当的参数,可以快速地得到很好的排序结果,能够适用于动态的车间调度问题.
Considering the conventional algorithms＇ low efficiency of search especially global search, PSO-based solution to job shop scheduling problem is presented. According to the characteristics of the problem, the PSO coding and optimization are studied to determine the way of coding and operation, which is more adaptable to job shop scheduling. The job shop scheduling part of the system is then programmed with the algorithm. Simulation results showed that setting the suitable parameters can provide an excellent working sequence to adapt to the dynamic job- shop problem.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2008年第4期565-568,共4页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目(60475036)
关键词
生产管理系统
车间调度
智能优化算法
粒子群算法
动态调度
production management system
job shop scheduling
intelligent optimization algorithms
PSO
dynamic scheduling
