首页 | 本学科首页   官方微博 | 高级检索  
     

基于粒子群算法的车间作业调度问题
引用本文:李小华,熊禾根.基于粒子群算法的车间作业调度问题[J].信息技术,2009(7):19-21.
作者姓名:李小华  熊禾根
作者单位:武汉科技大学机械自动化学院,武汉,430081
基金项目:湖北省重点实验室开放课题 
摘    要:通过对车间调度问题的描述,针对传统算法寻优效率低的弱点,提出了一种基于粒子群算法的车间作业调度问题的解决方案.对粒子群算法的基本原理进行了阐述,并对粒子群算法的编码、参数的选择以及解码进行了研究,以最小化最大流程时间作为评价算法的性能指标,将其用于编程求解典型调度问题.仿真结果表明,粒子群算法在求解车间作业调度的应用上是十分有效的.

关 键 词:车间调度  粒子群算法  智能优化算法

Job shop scheduling problem based on particle swarm optimization
LI Xiao-hua,XIONG He-gen.Job shop scheduling problem based on particle swarm optimization[J].Information Technology,2009(7):19-21.
Authors:LI Xiao-hua  XIONG He-gen
Affiliation:College of Machinery and Automation;Wuhan University of Science and Technology;Wuhan 430081;China
Abstract:Considering the conventional algorithms' low efficiency of searching for optimizing in job shop scheduling problems,the job shop scheduling solution is presented based on particle swarm optimization algorithm.In this paper,the basic theory of particle swarm optimization is described,also,the coding and selection of parameters as well as the decoding of PSO are studied.It uses the maximum flow time which being minimized to evaluate performance of the algorithm,and applies it to solve a typical scheduling pro...
Keywords:job-shop scheduling  particle swarm optimization (PSO)  intelligence optimization algorithms
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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