An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

Show other versions (1)

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representati...

Full description

Bibliographic Details
Main Authors: Mohammad Hassan Sebt, Mohammad Reza Afshar, Yagub Alipouri
Format: Article
Language:English
Published: Kharazmi University 2015-11-01
Series:International Journal of Supply and Operations Management
Subjects:
combinatorial optimization
multi-mode project scheduling
resource constraints
genetic algorithm
random key representation
Online Access:http://www.ijsom.com/article_2545_2be1fe07aaa4a2c83667c8cc99613d1b.pdf

Internet

http://www.ijsom.com/article_2545_2be1fe07aaa4a2c83667c8cc99613d1b.pdf

Similar Items