Dear users,
This is our new website
(we are launching the new one in order to improve our communication and provide better services to the editors and authors. So we will upload all data soon).
Please click here to visit our current website, and also to submit your paper: www.ijsom.com
Thanks for your patience during relocation.
Feel free to contact us via info@ijsom.comand ijsom.info@gmail.com
1- Amirkabir University of Technology, Tehran, Iran , sebt@aut.ac.ir 2- Amirkabir University of Technology, Tehran, Iran
Abstract: (4294 Views)
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) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP.
Sebt M H, Afshar M R, Alipouri Y. An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation. Journal title 2015; 2 (3) :905-924 URL: http://ijsom.khu.ac.ir/article-1-2545-en.html