Volume 19, Issue 4 (IJIE 2008)                   2008, 19(4): 85-91 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Seifi M, Tavakkoli-Moghaddam R, Jolai F. THE USE OF SIMULATED ANNEALING AND GENETIC ALGORITHMS FOR A MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM WITH DISCOUNTED CASH FLOWS. Journal title 2008; 19 (4) :85-91
URL: http://ijiepm.iust.ac.ir/article-1-248-en.html
THE USE OF SIMULATED ANNEALING AND GENETIC ALGORITHMS FOR A MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM WITH DISCOUNTED CASH FLOWS
M. Seifi , R. Tavakkoli-Moghaddam * , F. Jolai
, tavakoli@ut.ac.ir
Abstract:   (12505 Views)
This paper presents a multi-mode resource-constrained project scheduling problem (MRCPSP) with maximizing the net present value (NPV) form the project contractor’s point of view. Positive and negative cash flows are considered in this model. Furthermore, to make the model close to the real situations, four different models for positive cash flows are considered. Two meta-heuristics, called simulated annealing and genetic algorithms, are used in order to solve the proposed model of the forgoing problem. To schedule all activities, a bi-directional scheduling generation scheme (SGS) for the multi-mode version is proposed, and the activity list structure selects for presenting a permutation of activities. Finally, computational results for a set of test problems taken from the project scheduling problem library (PSPLIB) are presented and discussed.
Full-Text [PDF 263 kb]   (3477 Downloads)    
Type of Study: Research |
Received: 2010/06/28 | Published: 2008/12/15
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.