Reference Hub3
Application of Three Meta-Heuristic Algorithms for Maximizing the Net Present Value of a Resource-Constrained Project Scheduling Problem with Respect to Delay Penalties

Application of Three Meta-Heuristic Algorithms for Maximizing the Net Present Value of a Resource-Constrained Project Scheduling Problem with Respect to Delay Penalties

Masoud Rabbani, Azadeh Arjmand, Mohammad Mahdi Saffar, Moeen Sammak Jalali
Copyright: © 2016 |Volume: 3 |Issue: 1 |Pages: 15
ISSN: 2155-4153|EISSN: 2155-4161|EISBN13: 9781466693142|DOI: 10.4018/IJAIE.2016010101
Cite Article Cite Article

MLA

Rabbani, Masoud, et al. "Application of Three Meta-Heuristic Algorithms for Maximizing the Net Present Value of a Resource-Constrained Project Scheduling Problem with Respect to Delay Penalties." IJAIE vol.3, no.1 2016: pp.1-15. http://doi.org/10.4018/IJAIE.2016010101

APA

Rabbani, M., Arjmand, A., Saffar, M. M., & Jalali, M. S. (2016). Application of Three Meta-Heuristic Algorithms for Maximizing the Net Present Value of a Resource-Constrained Project Scheduling Problem with Respect to Delay Penalties. International Journal of Applied Industrial Engineering (IJAIE), 3(1), 1-15. http://doi.org/10.4018/IJAIE.2016010101

Chicago

Rabbani, Masoud, et al. "Application of Three Meta-Heuristic Algorithms for Maximizing the Net Present Value of a Resource-Constrained Project Scheduling Problem with Respect to Delay Penalties," International Journal of Applied Industrial Engineering (IJAIE) 3, no.1: 1-15. http://doi.org/10.4018/IJAIE.2016010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The Resource Constrained Project Scheduling Problem (RCPSP) is been studied under different kinds of constraints and limitations. In this paper, we are going to consider the discounted cash flows for project activities, and delay penalties which occur when the project make span exceeds its deadline as the objective function of the RCPSP. To solve the model, we will take advantage of three different meta-heuristic algorithms - Genetic Algorithm (GA), Imperialist Competitive Algorithm (ICA), and Shuffled Frog Leaping Algorithm (SFLA) - to achieve the optimal solution of the problem. The evaluation of the algorithms performance reveals that, in comparison with ICA and SFLA, GA performs better, especially in large-scale problems.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.