摘要
资源受限项目调度(RCPSP)是项目调度领域的经典问题,现有关于RCPSP的研究大多是在确定性环境下的进行的。然而项目在实际执行过程中,由于各工序的工期以及资源可用量都具有一定的不确定性,可能会导致项目的延迟甚至中断。通过分析广义优先关系(GPRs)网络的特点,以最小化项目总工期和最大化项目的鲁棒性为目标,建立了带有GPRs的前摄性资源受限项目调度模型,并根据基准进度计划对稳定性要求的特点,选用分支定界算法求得模型的精确解。最后,通过随机生成案例的方法测试了所提出的模型在求解带有GPRs的资源受限项目调度问题方面的稳定性。
Resource constrained project scheduling problem(RCPSP)is one of the classic problems in the field of project scheduling.Most of the existing research on RCPSP is conducted in the deterministic environment.However,in the actual implementation process of the project,due to the instability of the duration of each process and the available resources,the project may be delayed or even interrupted.In this paper,the resource constrained project scheduling problem with generalized precedence relations(GPRS)is studied.By analyzing the characteristics of GPRS network,a proactive resource constrained project scheduling model is established under the condition of GPRS.According to the stability requirements of benchmark schedule,the branch and bound algorithm is used to obtain the exact solution of the model.An example is given to test the stability of the proposed model in solving resource constrained project scheduling problem with GPRS.
作者
魏亚锋
张梦茹
苏志雄
WEI Yafeng;ZHANG Mengru;SU Zhixiong(School of Business Administration,Nanchang Institute of Technology,Nanchang 330099,China)
出处
《南昌工程学院学报》
CAS
2022年第4期102-108,共7页
Journal of Nanchang Institute of Technology
基金
江西省社会科学“十三五”规划项目(17GL32)
江西省教育厅科学技术研究项目(GJJ201920)
南昌工程学院研究生创新计划项目(YJSCX202104)。
关键词
前摄性调度
资源受限项目调度
广义优先关系
分支定界算法
proactive scheduling
resource constrained project scheduling
generalized priority relation
branch and bound algorithm