.png){kind=icon}
.png){kind=icon}
Return
An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2008.11.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP) aims at finding the start times and execution modes for the activities of a project that optimize a given objective function while verifying a set of precedence and resource constraints. In this paper, we focus on this problem and develop a hybrid Genetic Algorithm (MM-HGA) to solve it. Its main contributions are the mode assignment procedure, the fitness function and the use of a very efficient improving method. Its performance is demonstrated by extensive computational results obtained on a set of standard instances and against the best currently available algorithms. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Project management and scheduling
Renewable and non-renewable resources
Genetic Algorithms
Multimode forward-backward improving method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10
Papers:
7.9K
Citations:
3.6W