Characterization and generation of a general class of resource-constrained project scheduling problems

  title={Characterization and generation of a general class of resource-constrained project scheduling problems},
  author={Rainer Kolisch and Arno Sprecher and Andreas Drexl},
  journal={Management Science},
This paper addresses the issue of how to generate problem instances of controlled difficulty. It focuses on precedence- and resource-constrained (project) scheduling problems, but similar ideas may be applied to other network optimization problems. It describes a network construction procedure that takes into account a) constraints on the network topology, b) a resource factor that reflects the density of the coefficient matrix, and c) a resource strength, which measures the availability of… 

Figures from this paper

A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem

A new theoretical framework for the instance complexity for the resource-constrained project scheduling problem is proposed, consecutively incorporating precedence constraints, resource constraints, and activity durations, and shows that it is a strong discriminator between easy and hard instances and explains a large fraction of CPU times of optimal solution algorithms.

Network decomposition techniques for resource-constrained project scheduling

The results question the rigid construction of schedules by conventional algorithms relying on extensions of partial schedules, and thus provide fundamental insights into the development of exact solution procedures.

A Survey of Deterministic Modeling Approaches for Project Scheduling under Resource Constraints

An overview over various extensions of the basic RCPSP, including popular variants and extensions such as multiple modes, minimal and maximal time lags, and net present value-based objectives, is given.

Project scheduling with discrete time-resource and resource-resource tradeoffs

The solution procedure presented is a considerable generalization of the branch-and-bound algorithm proposed by Demeulemeester and Herroelen, which is currently the most powerful method for optimally solving the RCPSP.




The scheduling problem with resource constraints can be solved by generating a sequence of PERT networks which satisfy certain stability conditions and is shown to be equivalent to the problem of finding an optimal selection of arcs in a disjunctive graph with stability conditions.

Scheduling project networks with resource constraints and time windows

This work considers the problem to schedule project networks subject to arbitrary resource constraints in order to minimize an arbitrary regular performance measure (i.e. a non-decreasing function of the vector of completion times).

A branch-and-bound procedure for the multiple resource-constrained project scheduling problem

Problems requiring large amounts of computer time using existing approaches for solving this problem type are rapidly solved with the procedure using the dominance rules described, resulting in a significant reduction in the variability in solution times.

Project Scheduling with Discrete and Continuous Resources

  • J. Weglarz
  • Business
    IEEE Transactions on Systems, Man, and Cybernetics
  • 1979
An approximate method is described which consists of two stages; in the first stage the problem of scheduling activities with known performing times on parallel machines is solved, and in the second, the continuous resource is allocated among the activities (or parts of activities) which are performed simultaneously in the obtained schedule.

Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling

A new heuristic rule which compares favourably with the widely-used heuristic rules is developed, and the influence of network/resource characteristics on the performance of different heuristic Rules is investigated.

Two Approaches to Problems of Resource Allocation Among Project Activities — A Comparative Study

Two general approaches using linear programming in specific ways for solving a class of problems of resource allocation among project activities, where the resource requirements of each activity concern numbers of resource units from given finite sets for particular resource types.

A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling

Results indicate that while computation time is related to the project network structure, more significant factors are the number of activities and the relative values of the activity parameters, duration and resource requirement.

A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem

A recurring problem in managing project activity involves the allocation of scarce resources to the individual activities comprising the project Resource conflict resolution decisions must be made

Scheduling of Project Networks by Job Assignment

This paper considers the nonpreemptive variant of a resource-constrained project job-assignment problem, where job durations as well as costs depend upon the assigned resource, and presents a hybrid brand and bound/dynamic programming algorithm with a rather efficient Monte Carlo type heuristic upper bounding technique.