一种复杂项目调度问题的混合智能算法被引量：10

Hybrid algorithm for complex project scheduling

下载PDF

导出

摘要针对有资源约束的项目调度问题模型的不足,调研了企业需求,提出了带有预约时间窗口约束的项目调度模型,并针对该类模型的特点分析了原有算法存在的问题,将分枝定界算法与启发式算法相结合,提出了一种解决该类问题的混合智能算法。仿真结果表明,该算法的优化效果明显优于其他算法。 To deal with deficiency of Resource Constrained Project Scheduling Problem （RCPSP） model, a project scheduling model with engaged time windows constraint was proposed after surveying enterprises＇ demands. After analyzing the characteristics of the proposed model and the shortcomings of existing algorithms for model, a hybrid algorithm which combined branch-and-bound procedure and heuristic algorithms was presented. The simulation results demonstrated that the optimization effect of the proposed algorithm was better than other algorithms.

作者程序吴澄

机构地区清华大学自动化系

出处《计算机集成制造系统》 EI CSCD 北大核心 2006年第4期585-589,共5页 Computer Integrated Manufacturing Systems

基金国家重点基础研究计划资助项目(2002CB312202)。~~

关键词项目调度预约时间窗口约束分枝定界算法启发式算法 project scheduling engaged time window constraint branch-and-bound algorithm heuristic algorithm

分类号 F406.2 [经济管理—产业经济]

引文网络
相关文献

参考文献14

1HERROLEN W,REYCK B D,DEMEULEMEESTER E.Resource-constrained project scheduling:a survey of recent developments[J].Computers & Operations Research,1998,25(4):279-302.
2WEGLARZ J.Project scheduling:recent models,algorithms and applications[M].Amsterdam,Netherlands:Kluwer,1999.
3BRUCKER P,DREXL A,MOHRING R,et al.Resource-constrained project scheduling:notation,classification,models,and methods[J].European Journal of Operational Research,1999,112:3-41.
4DEMEULEMEESTER E,HERROLEN W.A branch-and-bound procedure for the multiple resource-constrained project scheduling problem[J].Management Science,1992,38 (12):1803-1818.
5DEMEULEMEESTER E,HERROLEN W.A branch-and-bound procedure for the generalized resource-constrained project scheduling problem[J].Operations Research,1997,45(2):201-212.
6REYCK B D,HERROLEN W.A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations[J].European Journal of Operational Research,1998,111:152-174.
7DORNDORF U,PESCH E,PHAN-HUY T.A time-oriented branch-and-bound algorithm for project scheduling with generalised precedence constraints[J].Management Science,2000,46:1365-1384.
8NEUMANN K,SCGWINDT C.Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production[J].Operation Research Spectrum,1997,19:205-217.
9HEILMANN R.A branch-and-bound procedure for the multi-mode resource constrained project scheduling problem with minimum and maximum time lags[J].European Journal of Operational Research,2003,144:348-365.
10BLAZEWICZ J,LENSTRA J,RINNOOYKA A.Scheduling subject to resource constraints:classification and complexity[J].Discrete Applied Mathematics,1983,5:11-24.