Abstract: The resource-constrained project scheduling problem(RCPSP)is an important class of optimization problems that arises from project management practices. The classical RCPSP assumes that activities cannot be interrupted once they have been started. However, this is not always the case in real-world project management. Activity preemption is not uncommon in project management practices. In preemptive project scheduling, project duration, cost and other performance measures may be optimized by interrupting some activities and assigning the released resources to other critical activities. Due to the theoretical importance and the practice background, preemptive project scheduling problems have been attracting many research efforts. This paper presents a literature survey of the research on preemptive project scheduling. The mathematical models of preemptive project scheduling problems are provided. Representative objective functions are investigated and an example project is given to illustrate the preemptive project scheduling problem. Solution algorithms, including exact methods, heuristics and meta-heuristics, are systematically reviewed. The extensions and applications of preemptive project scheduling problems are reviewed. Some future research opportunities are also proposed.

Key words: project scheduling, preemption, models, algorithms, literature review

摘要： 可抢占条件下的项目调度通过暂时中断某些活动的执行,释放资源给更重要的活动,从而优化项目的工期、成本等绩效指标。可抢占项目调度问题以其重要的理论价值和应用背景,受到了学界和业界的广泛关注。对国内外可抢占项目调度的研究成果进行了系统性总结与梳理,综述了可抢占项目调度问题的数学模型及其求解算法,总结了可抢占项目调度问题的一些扩展问题和应用情况,最后指出了未来进一步的研究方向。

关键词: 项目调度, 抢占, 模型, 算法, 综述