×

A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations. (English) Zbl 1162.90464

Summary: A resource investment problem with discounted cash flows (RIPDCF) is a project-scheduling problem in which (a) the availability levels of the resources are considered decision variables and (b) the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, the RIPDCF in which the activities are subject to generalized precedence relations is first modeled. Then, a genetic algorithm (GA) is proposed to solve this model. In addition, design of experiments and response surface methodology are employed to both tune the GA parameters and to evaluate the performance of the proposed method in 240 test problems. The results of the performance analysis show that the efficiency of the proposed GA method is relatively well.

MSC:

90B35 Deterministic scheduling theory in operations research
68T05 Learning and adaptive systems in artificial intelligence
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Icmeli, O.; Erengüç, S.S.; Zappe, C.J., Project scheduling problems: a survey, International journal of operations and production management, 13, 80-91, (1993)
[2] Elmaghraby, S.E., Activity nets: a guided tour through some recent developments, European journal of operational research, 64, 199-215, (1995) · Zbl 0910.90175
[3] Herroelen, W.S.; De Reyck, B.; Demeulemeester, E.L., Resource-constrained project scheduling: a survey of recent developments, Computers and operations research, 25, 279-302, (1999) · Zbl 1040.90525
[4] Demeulemeester, E.L.; Herroelen, W., Project scheduling: a research handbook, (2002), Kluwer Academic Publishers Boston · Zbl 1059.90068
[5] 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
[6] Demeulemeester, E.L., Minimizing resource availability costs in time limited project networks, Management science, 41, 1590-1598, (1995) · Zbl 0861.90071
[7] Demeulemeester, E.L.; Herroelen, W., A branch-and-bound procedure for the multiple resource-constrained project scheduling problem, Management science, 38, 1803-1818, (1992) · Zbl 0761.90059
[8] 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
[9] Akpan, E.O.P., Optimal resource determination for project scheduling, Production planning and control, 8, 462-468, (1997)
[10] Shadrokh, S.; Kianfar, F., A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty, European journal of operational research, 181, 86-101, (2007) · Zbl 1121.90062
[11] Zimmermann J, Engelhardt H. Lower bounds and exact algorithms for resource leveling problems. Technical Report 517, University of Karlsruhe; 1998.
[12] Nübel H. A branch and bound procedure for the resource investment problem subject to temporal constraints. Technical Report 574, University of Karlsruhe; 1999.
[13] Nübel, H., The resource renting problem subject to temporal constraints, OR spektrum, 23, 574-586, (2001) · Zbl 0985.90041
[14] Russell, A.H., Cash flows in networks, Management science, 16, 357-373, (1970) · Zbl 0187.18201
[15] Grinold, R.C., The payment scheduling problem, Naval research logistics quarterly, 19, 123-136, (1972) · Zbl 0252.90034
[16] 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
[17] 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)
[18] Russell, R.A., A comparison of heuristics for scheduling projects with cash flows and resource restrictions, Management science, 32, 291-300, (1986)
[19] 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)
[20] 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
[21] 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
[22] 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
[23] 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)
[24] 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)
[25] 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)
[26] Dayanand, N.; Padman, R., On modeling payments in projects, Journal of the operational research society, 48, 906-918, (1997) · Zbl 0892.90099
[27] 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
[28] De Reyck, B.; Herroelen, W.S., An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations, Computers and operations research, 25, 1-17, (1998) · Zbl 0909.90175
[29] 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
[30] Waligora, G., Discrete-continuous project scheduling with discounted cash flows—a tabu search approach, Computers and operations research, 35, 2141-2153, (2008) · Zbl 1177.90189
[31] Najafi, A.A.; Niaki, S.T.A., A genetic algorithm for resource investment problem with discounted cash flows, Applied mathematics and computations, 183, 1057-1070, (2006) · Zbl 1112.90035
[32] Weglarz, J., Project scheduling: recent models, algorithms and applications, (1999), Kluwer Academic Publishers Boston
[33] Nemhauser, G.L.; Rinnooy Kan, A.H.G.; Todd, M.J., Handbooks in operations research and management science, (1989), Elsevier B.V. Amsterdam
[34] Available from ⟨http://www.bwl.uni-kiel.de/prod/psplib/index.html⟩.
[35] Available from ⟨http://www.Lindo.com⟩.
[36] Myers, R.H.; Montgomery, D.C., Response surface methodology: process and product optimization using designed experiments, (1995), Wiley New York · Zbl 1161.62392
[37] Narasimhan, R., Goal programming in a fuzzy environment, Decision sciences, 11, 325-336, (1980)
[38] Tiwari, R.N.; Dharmar, S.; Rao, J.R., Fuzzy goal programming—an additive model, Fuzzy sets and systems, 24, 27-34, (1987) · Zbl 0627.90073
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.