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

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...

Cijeli opis

Spremljeno u:
Bibliografski detalji
Glavni autori: Mohammad Hassan Sebt, Mohammad Reza Afshar, Yagub Alipouri
Format: Artigo
Jezik:Inglês
Izdano: Kharazmi University 2015-11-01
Serija:International Journal of Supply and Operations Management
Teme:
Combinatorial optimization
Multi-mode project scheduling
Resource constraints
Genetic Algorithm
Random key representation
Online pristup:http://ijsom.com/article_2545_460.html
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!

Similar Items