Resource-constrained project scheduling: Notation, classification, models, and methods

https://www.econstor.eu/bitstream/10419/149843/1/manuskript_396.pdf

PSPLIB - A project scheduling problem library

http://web.nchu.edu.tw/pweb/users/arborfish/lesson/8682.pdf

A survey of variants and extensions of the resource-constrained project scheduling problem

https://www.econstor.eu/bitstream/10419/155418/1/manuskript_344.pdf

Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation

In this paper we consider the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective. We propose a new genetic algorithm approach to solve this problem. Subsequently, we compare it to two genetic algorithm concepts from the literature. While our approach makes use of a permutation based genetic encoding that contains problem-specific knowledge, the other two procedures employ a priority value based and a priority rule based representation, respectively. Then we present the results of our thorough computational study for which standard sets of project instances have been used. The outcome reveals that our procedure is the most promising genetic algorithm to solve the RCPSP. Finally, we show that our genetic algorithm yields better results than several heuristic procedures presented in the literature. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 733–750, 1998

A competitive genetic algorithm for resource-constrained project scheduling

https://www.econstor.eu/bitstream/10419/155398/1/manuskript_307.pdf

Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem

This paper addresses a general class of nonpreemptive resource-constrained project scheduling problems in which activity durations are discrete functions of committed renewable and nonrenewable resources. We provide a well known 0–1 problem formulation and stress the importance of the model by giving applications within production and operations management. Furthermore, we prove that the feasibility problem is already NP-complete. Solution procedures proposed so far have the following shortcomings: exact methods can solve only very small instances to optimality; heuristic solution approaches fail to generate feasible solutions when problems become highly resource-constrained. Hence, we propose a new local search method that first tries to find a feasible solution and secondly performs a single-neighborhood search on the set of feasible mode assignments. To evaluate the new procedure we perform a rigorous computational study on two benchmark sets. The experiment includes a comparison of our procedure with other heuristics.

https://www.econstor.eu/bitstream/10419/155429/1/manuskript_360.pdf

Local search for nonpreemptive multi-mode resource-constrained project scheduling

This is the second part of a paper considering the multi-mode resource-constrained project scheduling problem. The first part presents an exact Solution procedure for solving several variants of the multi-mode resource-constrained project scheduling problem including the commonly known makespan minimization problem. The basic scheine is enhanced by powerful search tree reduction schemes considerably useful when optimizing any regulär measure of Performance. The second part reports the results of a thorough computational study and the experience gained with the algorithm's realization. The procedure has been coded in C and implemented on a personal Computer. Using the Standard project generator ProGen we have es tablished a wide ränge of instances. More than ten thousand problem instances have been systematically generated to evaluate the algorithm's Performance. The experimental investigations demonstrate a superior Performance of the exact method and reasonable capabilities of the truncated exact approach. The size of the projects that can be solved to optimality has been nearly doubled. The main objectives of this part are: First, to give additional Information conceming Implementa­ tion of the algorithm and the bounding rules. Second, to illustrate the effect of the bounding rules. Third, to show the impact of th e Variation of several project characteristics on Solution time and quality. Fourth, to enlarge the set of project instances available for testing multi-mode procedures.

https://www.econstor.eu/bitstream/10419/181065/1/manuskript_386.pdf

Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation

We consider an extension of the classical resource-constrained project scheduling problem (RCPSP), which covers discrete resource-resource and time-resource tradeoffs. As a result a project scheduler is permitted to identify several alternatives or modes of accomplishment for each activity of the project. The solution procedure we present 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. More precisely, we extend their concept of delay alternatives by introducing mode alternatives. The basic enumeration scheme is then enhanced by dominance rules which highly increase the performance of the algorithm. The computational results obtained by solving the Standard ProGen instances indicate that the new method outperforms the most rapid procedure reported in the literature by a factor of four. Additionally and more important than the average reduction of the solution time is the substantial decrease of the variance of the solution times.

https://www.econstor.eu/bitstream/10419/155428/1/manuskript_357.pdf

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

We consider the resource-constrained project scheduling problem (RCPSP). The focus of the paper is on a formal definition of semi-active, active, and non-delay schedules. Traditionally these schedules establish basic concepts within the job shop scheduling literature. There they are usually defined in a rather informal way which does not create any substantial problems. Using these concepts in the more general RCPSP without giving a formal definition may cause serious problems. After providing a formal definition of semi-active, active, and non-delay schedules for the RCPSP we outline some of these problems occurring within the disjunctive arc concept.

Andreas Drexl

Papers

Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem

Local search for nonpreemptive multi-mode resource-constrained project scheduling

Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation

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

Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem