Showing 1 - 10 of 10
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...
Persistent link: https://www.econbiz.de/10008992371
This paper considers two problem classes that are important to researchers as well as practitioners, namely packing and project scheduling problems. First, the two problem categories are described. This includes a classification of packing problems as well as of project scheduling concepts....
Persistent link: https://www.econbiz.de/10011734909
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...
Persistent link: https://www.econbiz.de/10011734932
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,...
Persistent link: https://www.econbiz.de/10011736626
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...
Persistent link: https://www.econbiz.de/10011736751
Persistent link: https://www.econbiz.de/10011737223
Persistent link: https://www.econbiz.de/10011737337
Persistent link: https://www.econbiz.de/10011787477
We consider the multi-mode resource-constrained project scheduling problem. The focus is on an algorithm which is supposed to find a makespan optimal solution. This algorithm has been presented in a recent paper by Speranza and Vercellis. The correctness of the algorithm is examined. Moreover,...
Persistent link: https://www.econbiz.de/10011739501
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...
Persistent link: https://www.econbiz.de/10011743239