Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

9-1996

Abstract

Resource-constrained project scheduling involves the scheduling of project activities subject to precedence and resource constraints in order to meet the objective(s) in the best possible way. The area covers a wide variety of problem types. The objective of this paper is to provide a survey of what we believe are the important recent developments in the area. Our main focus will be on the recent progress made in and the encouraging computational experience gained with the use of optimal solution procedures for the basic resource-constrained project scheduling problem (RCPSP) and important extensions. We illustrate how the branching rules, dominance and bounding arguments of a new depth- first branch-and-bound procedure can be extended to a rich variety of related problems: the generalized resource-constrained project scheduling problem, the resource-constrained project scheduling problem with generalized precedence relations, the preemptive resource-constrained project scheduling problem, the resource availability cost problem, and the resource-constrained project scheduling problem with various time/resource(cost) trade-offs and discounted cash flows.

Keywords

Search Tree, Precedence Constraint, Project Schedule, Project Schedule Problem, Partial Schedule

Discipline

Business Administration, Management, and Operations | Management Information Systems

Research Areas

Operations Management

Publication

Operations Research Proceedings 1996, Braunschweig, Germany, September 3-6

First Page

197

Last Page

202

ISBN

9783S4062630S

Identifier

10.1007/978-3-642-60744-8_36

Publisher

SpringerLink

City or Country

Braunschweig

Embargo Period

8-31-2021

External URL

https://doi.org/10.1007/978-3-642-60744-8_36

Download

Share

COinS