.png){kind=icon}
.png){kind=icon}
Return
Project scheduling with limited resources using a genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijproman.2009.10.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a genetic algorithm for the Resource-Constrained Project Scheduling Problem (RCPSP). In comparison with previous genetic algorithms proposed in literature for this problem, this paper proposes an alternative representation of the chromosomes using a multi-array object-oriented model in order to take advantage of programming features in most common languages for the design of decision support systems. The approach was tested on sets of standard problems taken from the literature and freely available on the Internet (PSPLIB). Computational results validate the effectiveness of the proposed algorithm and show that our procedure equals most of previous results with less computational time. (C) 2009 Elsevier Ltd and IPMA. All rights reserved.
Keywords:
Project scheduling
Genetic algorithm
Object-oriented model
Experimental analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.6K
Citations:
1.2W