By Topic

Solving resource-constrained project scheduling problem by a genetic local search approach

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dridi, O. ; LARODEC Lab., Univ. of Tunis, Bardo, Tunisia ; Krichen, S. ; Guitouni, A.

The resource-constrained project scheduling problem is a general scheduling problem which involving activities need to be scheduled such that the makespan is minimized. However, the RCPSP is confirmed to be an NP-hard combinatorial problem. Restated, it is hard to be solved in a reasonable computational time. Therefore, numerous metaheuristics-based approaches have been developed for finding near-optimal solution for RCPSP. Genetic algorithms have been applied to a wide variety of combinatorial optimization problems and have proved their efficiency. However, prematurely convergence may lead to search stagnation on restricted regions of the search space. To deal with this drawback and beside the good performances attained by local search procedures, a genetic local search algorithm for solving the RCPSP is proposed. Simulation results demonstrate that the proposed GLSA provides an effective and efficient approach for solving RCPSP.

Published in:

Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on

Date of Conference:

28-30 April 2013