期刊文献+

基于动态多目标粒子群优化算法的资源受限研发项目进度 被引量:6

The Resource-constrained R&G Project Scheduling Problem Based on Dynamic Multi-object Particle Swarm Optimization Algorithm
下载PDF
导出
摘要 资源与进度优化调度已成为企业研发项目成功的关键。引入粒子群算法来解决这一问题,将普通粒子群多目标算法进行了改进,提出动态的多目标粒子群算法,通过采用VC++编程语言对模型及其求解算法进行案例仿真,证实了模型及算法的有效性与优越性。 Resource and scheduling optimization in enterprise has become the key to the R&G project's success. PSO introduced to solve this problem, the article proposed dynamic particle swarm multiple objective algorithm through improving original particle swarm multiple objective algorithms. The simulation on the model and algorithm proved the validity and sutmriority of the model and algorithm by using VC++.
作者 曲红 吴娟
出处 《系统工程》 CSCD 北大核心 2007年第9期98-102,共5页 Systems Engineering
关键词 资源受限 研发项目进度问题 多日标模型 动态多日标粒子群优化算法 R&G Project Scheduling Problem Multiple Objective Model Dynamic Multi-objectiveParticle Swarm Optimization Algorithm
  • 相关文献

参考文献4

  • 1Kennedy J,Eberhart R.Particle swarm optimization[A].Proe.IEEE Int.Conf.on Neural Networks[C].Perth,Australia,1995:1942-1948.
  • 2彭传勇,高亮,邵新宇,周驰.求解作业车间调度问题的广义粒子群优化算法[J].计算机集成制造系统,2006,12(6):911-917. 被引量:30
  • 3Kolisch R.Serial and parallel resource-constrained project scheduling methods revisited,theory and computation[J].European Journal of Operational Research,1996,(90):320-333.
  • 4Kolisch R,Sprecher A.PSPLIB-A project scheduling problem library[J].European Journal of Operational Research,1996:205-216.

二级参考文献23

  • 1高海兵,高亮,周驰,喻道远.基于粒子群优化的神经网络训练算法研究[J].电子学报,2004,32(9):1572-1574. 被引量:93
  • 2张超勇,饶运清,李培根,刘向军.求解作业车间调度问题的一种改进遗传算法[J].计算机集成制造系统,2004,10(8):966-970. 被引量:52
  • 3李爱国.多粒子群协同优化算法[J].复旦学报(自然科学版),2004,43(5):923-925. 被引量:398
  • 4CAREY E L,JOHNSON D S,SETHI R.The complexity of flowshop and job-shop scheduling[J].Mathematics of Operations Research,1976,1 (2):117-129.
  • 5CROCE F D,TADEI R,VOLTA G.A genetic algorithm for the job shop problem[J].Computers & Operations Research,1995,22(1):15-24.
  • 6BEATRICE M O,MARIO V.Local search genetic algorithms for the job shop scheduling problem[J].Applied Intelligence,2004,21(1):99-109.
  • 7KOLONKO M.Some new results on simulated annealing applied to the job shop scheduling problem[J].European Journal of Operational Research,1999,113(1):123-126.
  • 8PEZZELLA F,MERELLI E.A tabu search method guided by shifting bottleneck for the job shop scheduling problem[J].European Journal of Operational Research,2000,120 (2):297-310.
  • 9FARUK G.The strategies and parameters of tabu search for job-shop scheduling[J].Journal of Intelligent Manufacturing,2004,15 (4):439-448.
  • 10ZHOU Pin,LI Xiaoping,ZHANG Hongfang.An ant colony algorithm for job shop scheduling problem[A].Fifth World Congress on Intelligent Control and Automation[C].Piscataway,NJ,USA:IEEE Service Center,2004.2899-2903.

共引文献29

同被引文献51

引证文献6

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部