可更新资源受限的工期-费用权衡问题及粒子群算法

传统离散时间-费用权衡项目调度问题(DTCTP)中,可更新资源约束被忽略,将可更新资源约束引入DTCTP模型,形成可更新资源受限的工期-费用权衡项目调度问题(RRCDCTP)。在活动执行模式中增加可更新资源需求量,并考虑项目执行中的单位工期的可更新资源限量约束,基于可更新和不可更新两类资源的使用量计算活动费用。根据模型特点,提出一种求解该模型的粒子群优化算法。实例验证结果表明,当存在可更新资源约束时,在相同总费用预算约束下,RRCDCTP获得的最优项目工期比DTCTP获得最优工期长;同时,可更新资源限量越小,最优调度计划中具有浮动时差的活动数越少。

Renewable Resource-constrained Duration/Cost Trade-off Problem and a Particle Swarm Optimization Algorithm

The discrete time/cost trade-off problem(DTCTP) is an important problem in project scheduling.When renewable resources are considered,the classical DTCTP is extended to a new problem called renewable resource-constrained duration/cost trade-off problem(RRCDCTP),where the amount and availability of renewable resources is considered when an operation is performed and the activity cost includes the cost of two kinds of resources(renewable and nonrenewable).A particle swarm optimization algorithm for the problem is developed and the results of an example show that the optimal project duration of RRCDCTP is longer than that of DTCTP.Moreover,the fewer renewable resources are,the little amount of activities with float times is in the optimal schedule.