作业车间调度
计算机科学
调度(生产过程)
数学优化
运筹学
启发式
资源限制
地铁列车时刻表
分布式计算
数学
人工智能
操作系统
作者
Sönke Hartmann,Dirk Briskorn
标识
DOI:10.1016/j.ejor.2009.11.005
摘要
The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is minimized. It has become a well-known standard problem in the context of project scheduling which has attracted numerous researchers who developed both exact and heuristic scheduling procedures. However, it is a rather basic model with assumptions that are too restrictive for many practical applications. Consequently, various extensions of the basic RCPSP have been developed. This paper gives an overview over these extensions. The extensions are classified according to the structure of the RCPSP. We summarize generalizations of the activity concept, of the precedence relations and of the resource constraints. Alternative objectives and approaches for scheduling multiple projects are discussed as well. In addition to popular variants and extensions such as multiple modes, minimal and maximal time lags, and net present value-based objectives, the paper also provides a survey of many less known concepts.
科研通智能强力驱动
Strongly Powered by AbleSci AI