الفهرس 
INTRODUCTIONOnly 14 pages are availabe for public view
 |  | from | 89 |  |  |
| | | from | 89 | | |
Abstract
Resource - constrained project scheduling problem (RCPSP) is a well known problem and
aims to determine the start time of each activity of the project which satisfy the logic
sequence of activities (dependency) and the limitation of resources with the objective of
minimizing the project duration. In this research, an algorithm is constructed to solve the
classical RCPSP. The problem is formulated as an optimization problem, where the
decision variables are start times of activities. Two constraints are considered; precedence
which is presented as linear constraint, and resource limitation which is presented as non-
linear constraint. The Genetic Algorithm is used as an optimization technique included in a
software program coded in MA TLAB. The algorithm solves problems of any number of
activities with multiple renewable resources. Resource availabilities and consumptions are
assumed to be uniform with respect to time.
In order to evaluate the proposed algorithm, standard benchmark problems should be used.
Single mode project scheduling set of Kolisch (j30) is used. This set contains 480 projects,
each project has 30 non-dummy activities and with four renewable resources per project.
This set is included in Project scheduling problem library of Kolisch (PSPLIB). In
addition, a case study of real construction project is used to support the results where the
results of the proposed algorithm are compared with commercial software, (primavera).
The algorithm results are analyzed and compared with the results of other heuristics from
the literature. Computational experiments show that the proposed algorithm is competitive
with other heuristics and capable of solving RCPSP with good performance.
Keywords: project scheduling, resource constraints, Genetic Algorithm, optimization,
Experimental evaluation.