##
**A priority rule-based heuristic for resource investment project scheduling problem with discounted cash flows and tardiness penalties.**
*(English)*
Zbl 1181.90123

Summary: The resource investment problem with discounted cash flows (RIPDCFs) is a class of project scheduling problems. In RIPDCF, the availability levels of the resources are considered decision variables, and the goal is to find a schedule such that the net present value of the project cash flows optimizes.

In this paper, we consider a new RIPDCF in which tardiness of project is permitted with defined penalty. We mathematically formulated the problem and developed a heuristic method to solve it. The results of the performance analysis of the proposed method show an effective solution approach to the problem.

In this paper, we consider a new RIPDCF in which tardiness of project is permitted with defined penalty. We mathematically formulated the problem and developed a heuristic method to solve it. The results of the performance analysis of the proposed method show an effective solution approach to the problem.

### MSC:

90B35 | Deterministic scheduling theory in operations research |

90C59 | Approximation methods and heuristics in mathematical programming |

PDF
BibTeX
XML
Cite

\textit{A. A. Najafi} and \textit{F. Azimi}, Math. Probl. Eng. 2009, Article ID 106425, 10 p. (2009; Zbl 1181.90123)

### References:

[1] | O. Icmeli, S. S. Erengü\cc, and C. J. Zappe, “Project scheduling problems: a survey,” International Journal of Operations and Production Management, vol. 13, no. 11, pp. 80-91, 1993. |

[2] | S. E. Elmaghraby, “Activity nets: a guided tour through some recent developments,” European Journal of Operational Research, vol. 82, no. 3, pp. 383-408, 1995. · Zbl 0910.90175 |

[3] | W. Herroelen, B. De Reyck, and E. Demeulemeester, “Resource-constrained project scheduling: a survey of recent developments,” Computers & Operations Research, vol. 25, no. 4, pp. 279-302, 1998. · Zbl 1040.90525 |

[4] | E. Demeulemeester and W. Herroelen, Project Scheduling: A Research Handbook, Kluwer Academic Publishers, Boston, Mass, USA, 2002. · Zbl 1059.90068 |

[5] | R. H. Möhring, “Minimizing costs of resource requirements in project networks subject to a fixed completion time,” Operations Research, vol. 32, no. 1, pp. 89-120, 1984. · Zbl 0531.90049 |

[6] | E. L. Demeulemeester, “Minimizing resource availability costs in time-limited project networks,” Management Science, vol. 41, no. 10, pp. 1590-1598, 1995. · Zbl 0861.90071 |

[7] | E. L. Demeulemeester and W. Herroelen, “A branch-and-bound procedure for the multiple resource-constrained project scheduling problem,” Management Science, vol. 38, no. 12, pp. 1803-1818, 1992. · Zbl 0761.90059 |

[8] | A. Drexl and A. Kimms, “Optimization guided lower and upper bounds for the resource investment problem,” Journal of the Operational Research Society, vol. 52, no. 3, pp. 340-351, 2001. · Zbl 1131.90378 |

[9] | E. O. P. Akpan, “Optimum resource determination for project scheduling,” Production Planning and Control, vol. 8, no. 5, pp. 462-468, 1997. |

[10] | S. Shadrokh and F. Kianfar, “A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty,” European Journal of Operational Research, vol. 181, no. 1, pp. 86-101, 2007. · Zbl 1121.90062 |

[11] | H. Nübel, “The resource renting problem subject to temporal constraints,” OR Spektrum, vol. 23, no. 3, pp. 359-381, 2001. · Zbl 0985.90041 |

[12] | A. H. Russell, “Cash flows in networks,” Management Science, vol. 16, no. 5, pp. 357-373, 1970. · Zbl 0187.18201 |

[13] | R. C. Grinold, “The payment scheduling problem,” Naval Research Logistics Quarterly, vol. 19, no. 1, pp. 123-136, 1972. · Zbl 0252.90034 |

[14] | R. H. Doersch and J. H. Patterson, “Scheduling a project to maximize its present value: a zero-one programming approach,” Management Science, vol. 23, no. 8, pp. 882-889, 1977. · Zbl 0354.90043 |

[15] | R. B. Bey, R. H. Doersch, and J. H. Patterson, “The net present value criterion: its impact on project scheduling,” Project Management Quarterly, vol. 12, pp. 35-45, 1981. |

[16] | R. A. Russell, “A comparison of heuristics for scheduling projects with cash flows and resource restrictions,” Management Science, vol. 32, no. 10, pp. 1291-1300, 1986. |

[17] | D. E. Smith-Daniels and V. L. Smith-Daniels, “Maximizing the net present value of a project subject to materials and capital constraints,” Journal of Operations Management, vol. 7, no. 1-2, pp. 33-45, 1987. |

[18] | O. Icmeli and S. S. Erenguc, “A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows,” Management Science, vol. 42, no. 10, pp. 1395-1408, 1996. · Zbl 0880.90074 |

[19] | B. A. Nadjafi and S. Shadrokh, “An algorithm for the weighted earliness-tardiness unconstrained project scheduling problem,” Journal of Applied Sciences, vol. 8, no. 9, pp. 1651-1659, 2008. |

[20] | S. E. Elmaghraby and W. S. Herroelen, “The scheduling of activities to maximize the net present value of projects,” European Journal of Operational Research, vol. 49, no. 1, pp. 35-49, 1990. · Zbl 1403.90670 |

[21] | K. K. Yang, F. B. Talbot, and J. H. Patterson, “Scheduling a project to maximize its net present value: an integer programming approach,” European Journal of Operational Research, vol. 64, no. 2, pp. 188-198, 1993. · Zbl 0769.90053 |

[22] | G. Ulusoy and L. Özdamar, “A heuristic scheduling algorithm for improving the duration and net present value of a project,” International Journal of Operations and Production Management, vol. 15, no. 1, pp. 89-98, 1995. |

[23] | S. M. Baroum and J. H. Patterson, “The development of cash flow weight procedures for maximizing the net present value of a project,” Journal of Operations Management, vol. 14, no. 3, pp. 209-227, 1996. |

[24] | J. P. Pinder and A. S. Marucheck, “Using discounted cash flow heuristics to improve project net present value,” Journal of Operations Management, vol. 14, no. 3, pp. 229-240, 1996. |

[25] | N. Dayanand and R. Padman, “On modeling payments in projects,” Journal of the Operational Research Society, vol. 48, no. 9, pp. 906-918, 1997. · Zbl 0892.90099 |

[26] | C. Sepil and N. Ortac, “Performance of the heuristic procedures for constrained projects with progress payments,” Journal of the Operational Research Society, vol. 48, no. 11, pp. 1123-1130, 1997. · Zbl 0894.90082 |

[27] | B. De Reyck and W. Herroelen, “An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations,” Computers and Operations Research, vol. 25, no. 1, pp. 1-17, 1998. · Zbl 0909.90175 |

[28] | G. Ulusoy, F. Sivrikaya-\cSerifo\uglu, and \cS. \cSahin, “Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows,” Annals of Operations Research, vol. 102, no. 1-4, pp. 237-261, 2001. · Zbl 0990.90509 |

[29] | G. Waligóra, “Discrete-continuous project scheduling with discounted cash flows-a tabu search approach,” Computers and Operations Research, vol. 35, no. 7, pp. 2141-2153, 2008. · Zbl 1177.90189 |

[30] | A. A. Najafi and S. T. A. Niaki, “Resource investment problem with discounted cash flows,” International Journal of Engineering, Transactions B, vol. 18, no. 1, pp. 53-64, 2005. · Zbl 1122.90357 |

[31] | A. A. Najafi and S. T. A. Niaki, “A genetic algorithm for resource investment problem with discounted cash flows,” Applied Mathematics and Computation, vol. 183, no. 2, pp. 1057-1070, 2006. · Zbl 1112.90035 |

[32] | 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.