×

A genetic algorithm for resource investment problem with discounted cash flows. (English) Zbl 1112.90035

Summary: A resource investment problem with discounted cash flows is a project scheduling problem in which the availability levels of the resources are considered decision variables and the goal is to find a schedule and resource requirement levels such that the net present value of the project cash flows optimizes. In this paper, we present a genetic algorithm to solve this problem. We explain the elements of the algorithm such as chromosome structure, fitness function, crossover, mutation, and local improvement operations and solve more than 220 problems with known optimal solutions to evaluate the performance of the proposed algorithm. The results of the experimentation are quite satisfactory.

MSC:

90B35 Deterministic scheduling theory in operations research
90C59 Approximation methods and heuristics in mathematical programming
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Tavares, L.V., A review of the contribution of operation research to project management, European journal of operational research, 136, 1-18, (2002) · Zbl 1086.90532
[2] Brucker, P.; Drexl, A.; Mohring, R.; Neumann, K.; Pesch, E., Resource-constrained project scheduling: notation, classification, models and methods, European journal of operational research, 112, 3-41, (1999) · Zbl 0937.90030
[3] Mohring, R.H., Minimizing costs of resource requirements in project networks subject to a fix completion time, Operational research, 32, 89-120, (1984) · Zbl 0531.90049
[4] Demeulemeester, E.L., Minimizing resource availability costs in time limited project networks, Management science, 41, 1590-1598, (1995) · Zbl 0861.90071
[5] Akpan, E.O.P., Optimal resource determination for project scheduling, Production planning and control, 8, 462-468, (1997)
[6] Drexl, A.; Kimms, A., Optimization guided lower and upper bounds for the resource investment problem, Journal of the operational research society, 52, 340-351, (2001) · Zbl 1131.90378
[7] S. Shadrokh, F. Kianfar, A genetic algorithm for resource investment problem, Ph.D. thesis, Sharif University of Technology, Iran, 2004. · Zbl 1121.90062
[8] J. Zimmermann, H. Engelhardt, Lower bounds and exact algorithms for resource leveling problems, Technical Report 517, University of Karlsruhe, Germany, 1998.
[9] H. Nübel, A branch and bound procedure for the resource investment problem subject to temporal constraints, Technical Report 574, University of Karlsruhe, Germany, 1999.
[10] Nübel, H., The resource renting problem subject to temporal constraints, OR spektrum, 23, 574-586, (2001) · Zbl 0985.90041
[11] Doersch, R.H.; Patterson, J.H., Scheduling a project to maximize its present value; zero-one programming approach, Management science, 23, 882-889, (1977) · Zbl 0354.90043
[12] Russell, A.H., Cash flows in networks, Management science, 16, 357-373, (1970) · Zbl 0187.18201
[13] Grinold, R.C., The payment scheduling problem, Naval research logistics quarterly, 19, 123-136, (1972) · Zbl 0252.90034
[14] Bey, R.B.; Doersch, R.H.; Patterson, J.H., The net present value criterion; its impact on project scheduling, Project management quarterly, 12, 223-233, (1981)
[15] Russell, R.A., A comparison of heuristics for scheduling projects with cash flows and resource restrictions, Management science, 32, 291-300, (1986)
[16] Smith-Daniels, D.E.; Smith-Daniels, V.L., Maximizing the net present value of a project subject to materials and capital constraints, Journal of operations management, 7, 33-45, (1987)
[17] Icmeli, O.; Erenguc, S.S., A branch and bound procedure the resource-constrained project scheduling problem with discounted cash flows, Management science, 42, 1395-1408, (1996) · Zbl 0880.90074
[18] Elmaghraby, S.E.; Herroelen, W.S., The scheduling of activities to maximize the net present value of projects, European journal of operational research, 49, 35-49, (1990) · Zbl 1403.90670
[19] E. Demeulemeester, W. Herroelen, P. Van Dommelen, An optimal recursive search procedure for the deterministic unconstrained Max-npv project scheduling problem, Research Report 9603, Department of Applied Economics, K.U. Leuven, 1996.
[20] C. Sepil, B. Kazaz, Project scheduling with discounted cash flows and progress payments, Working Paper, Middle East Technical University, 1995. · Zbl 0863.90088
[21] D.E. Smith-Daniels, Summary measures for predicting the net present value of a project, Working Paper, College of St. Thomas, Minnesota, 1986.
[22] S.M. Baroum, An exact solution procedure for maximizing the net present value of resource-constrained projects, Ph.D. thesis, Indiana University, 1992.
[23] Yang, K.K.; Talbot, F.B.; Patterson, J.H., Scheduling a project to maximize its net present value; an integer programming approach, European journal of operational research, 64, 188-198, (1992) · Zbl 0769.90053
[24] Smith-Daniels, D.E.; Aquilano, N.J., Using a late start resource constrained project schedule to improve net present value, Decision sciences, 18, 617-630, (1987)
[25] Baroum, S.M.; Patterson, J.H., The development of cash flow weight procedures for maximizing the net present value of a project, Journal of operation management, 14, 209-227, (1996)
[26] R. Padman, J.H. Patterson, A comparative evaluation of cash flow weight heuristics for maximizing the net present value of a project, Working Paper, King Abdul Aziz University, 1993.
[27] R. Padman, D.E. Smith-Daniels, V.L. Smith-Daniels, Heuristic scheduling of resource-constrained project scheduling problem with discounted cash flows: an optimization-guided approach, Working Paper, Arnegie-Ellon University, 1990. · Zbl 0890.90108
[28] Ulusoy, G.; Ozdamar, L., A heuristic scheduling algorithm for improving the duration and net present value of a project, International journal of operations and production management, 15, 89-98, (1995)
[29] R. Padman, D.E. Smith-Daniels, Maximizing the net present value of capital constrained projects: an optimization guided approach, Working Paper, Carnegie Mellon University, 1993.
[30] Sepil, C.; Ortac, N., Performance of the heuristic procedures for constrained projects with progress payments, Journal of the operational research society, 48, 1123-1130, (1997) · Zbl 0894.90082
[31] S.S. Erenguc, S. Tufekei, C.J. Zappe, The solution of the time/cost trade-off problem with discounted cash flows using generalized benders decomposition, Research Report, University of Florida, 1991.
[32] Ulusoy, G.; Sivrikaya, F., Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows, Annals of operations research, 102, 237-261, (2001) · Zbl 0990.90509
[33] Dayanand, N.; Padman, R., On modeling payments in projects, Journal of the operational research society, 48, 906-918, (1997) · Zbl 0892.90099
[34] Pinder, J.P.; Marucheck, A.S., Using discounted cash flow heuristics to improve project net present value, Journal of operation management, 14, 229-240, (1996)
[35] Kolish, R.; Sprecher, A.; Drexl, A., Characterization and generation of a general class of resource-constrained project scheduling problems, Management science, 41, 1693-1703, (1995) · Zbl 0870.90070
[36] Available from: <http://www.Lindo.com>.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.