Hamidreza Shahabifard; Behrouz Afshar-nadjafi
Abstract
In this paper, a mathematical model is proposed for project portfolioselection and resource availability cost problem to scheduling activities inorder to maximize net present value of the selected projects preservingprecedence and resource constraints. Since the developed model belongs toNP-hard problems ...
Read More
In this paper, a mathematical model is proposed for project portfolioselection and resource availability cost problem to scheduling activities inorder to maximize net present value of the selected projects preservingprecedence and resource constraints. Since the developed model belongs toNP-hard problems list, so a genetic based meta-heuristic algorithm isproposed to tackle the developed model. In the proposed algorithm besidecommon operators of genetic algorithms such as crossover & mutation, someintelligent operators are utilized for local search in computed resources andshifting the activities with negative cash flows. The key parameters of thealgorithm are calibrated using Taguchi method to accelerate convergence ofthe proposed algorithm. Then, the algorithm is used to solve 90 testproblems consisting 30 small-scale, 30 middle-scale and 30 large scaleproblems to examine the algorithm’s performance. It is observed that, insmall problems, the obtained solutions from the proposed genetic algorithmhave been comparably better than the local optimum solutions stemmedfrom Lingo software. On the other hand, for the middle and large sizeproblems which there is no local optimum available within the limited CPUtime, robustness of the proposed algorithm is appropriate
Amine Keramaty; Majid Esmaelian; Masoud Rabieh
Volume 13, Issue 39 , January 2016, , Pages 63-90
Abstract
This paper presents a mathematical model for the multi-mode resource-constrained project scheduling problem with maximizing the net present value of project. The proposed model is inspired by MRCPSP-GPR. Firstly, we presented an exact model solving MRCPSP_GPR then we expanded the model to estimate other ...
Read More
This paper presents a mathematical model for the multi-mode resource-constrained project scheduling problem with maximizing the net present value of project. The proposed model is inspired by MRCPSP-GPR. Firstly, we presented an exact model solving MRCPSP_GPR then we expanded the model to estimate other cost-related options, penalty-related expenditure is a case in point. As a result of estimating different factors which impact on project scheduling such as reward and penalty of finishing the project, managers can efficiently make a better decision. For better adaptation with real conditions, we consider two payment methods in two objective functions. The adjusted schedule by proposed model and solving time was logical. Moreover, to verify the proposed model, a numerical example is solved in small size and the related computational results are illustrated in terms of schedules. In addition, computational results with a set of 36 test problems in various sizes are reported and the results analyzed.
