This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the...

In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity and makespan minimization as objective. We present a new genetic algorithm approach to solve this problem. The genetic encoding is based on a precedence feasible sequence...

We consider the classical resource-constrained project scheduling problem (RCPSP). The paper gives a detailed algorithmic description and provides theoretical results on two widely known problem specific heuristics: The serial and the parallel scheduling scheme. An in-depth computational study...

We review the well-known RSM priority rule to solve the resource constrained project scheduling problem. A detailed analysis of this rule reveals that it is based on assumptions which do not hold in general and hence might lead to poor solutions. Consequently, an improved RSM priority rule is...

This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the...

This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple execution modes for each activity. After summarizing the two exact algorithms that have been suggested in the literature,...

In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity and makespan minimization as objective. We present a new genetic algorithm approach to solve this problem. The genetic encoding is based on a precedence feasible sequence...

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...