Reference Hub1
Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem

Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem

Touihri Alaa, Krichen Saoussen, Guitouni Adel
Copyright: © 2015 |Volume: 6 |Issue: 2 |Pages: 16
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781466677920|DOI: 10.4018/IJAMC.2015040104
Cite Article Cite Article

MLA

Alaa, Touihri, et al. "Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem." IJAMC vol.6, no.2 2015: pp.45-60. http://doi.org/10.4018/IJAMC.2015040104

APA

Alaa, T., Saoussen, K., & Adel, G. (2015). Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem. International Journal of Applied Metaheuristic Computing (IJAMC), 6(2), 45-60. http://doi.org/10.4018/IJAMC.2015040104

Chicago

Alaa, Touihri, Krichen Saoussen, and Guitouni Adel. "Genetic Algorithm for Solving the Resource Constrained Project Scheduling Problem," International Journal of Applied Metaheuristic Computing (IJAMC) 6, no.2: 45-60. http://doi.org/10.4018/IJAMC.2015040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The present paper develops a multi–dimensional genetic algorithm for the Resource constrained project scheduling problem. This algorithm performs a series of perturbations in an attempt to improve the current solution, applying some problem dependant genetic operators. The procedure used is efficient and easy to implement. The approach was tested on sets of standard problems freely available on the Internet (PSPLIB) and the results were compared to those found in the literature. It was found that the algorithm used is able to generate competitive results compared to the best methods known so far and computes, for the first time, four optimal solutions for four benchmark instance.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.