IDEAS home Printed from https://ideas.repec.org/p/rug/rugwps/06-417.html
   My bibliography  Save this paper

A scatter search procedure for maximizing the net present value of a project under renewable resource constraints

Author

Listed:
  • M. VANHOUCKE

Abstract

In this paper, we present a meta-heuristic algorithm for the well-known resource-constrained project scheduling problem with discounted cash flows. This optimization procedure maximizes the net present value of project subject to the precedence and renewable resource constraints. The problem is known to be NP-hard. We investigate the use of a enhanced bi-directional generation scheme and a recursive forward/backward improvement method and embed them in a meta-heuristic scatter search framework. We generate a large dataset of project instances under a controlled design and report detailed computational results. The solutions and project instances can be downloaded from a website in order to facilitate comparison with future research attempts.

Suggested Citation

  • M. Vanhoucke, 2006. "A scatter search procedure for maximizing the net present value of a project under renewable resource constraints," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/417, Ghent University, Faculty of Economics and Business Administration.
    • Handle: RePEc:rug:rugwps:06/417
    as

    Download full text from publisher

    File URL: http://wps-feb.ugent.be/Papers/wp_06_417.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Robert A. Russell, 1986. "A Comparison of Heuristics for Scheduling Projects with Cash Flows and Resource Restrictions," Management Science, INFORMS, vol. 32(10), pages 1291-1300, October.
    2. Marti, Rafael & Laguna, Manuel & Glover, Fred, 2006. "Principles of scatter search," European Journal of Operational Research, Elsevier, vol. 169(2), pages 359-372, March.
    3. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    4. Rema Padman & Dwight E. Smith‐Daniels & Vicki L. Smith‐Daniels, 1997. "Heuristic scheduling of resource‐constrained projects with cash flows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 365-381, June.
    5. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    6. Dan Zhu & Rema Padman, 1999. "A metaheuristic scheduling procedure for resource‐constrained projects with cash flows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(8), pages 912-927, December.
    7. Padman, Rema & Smith-Daniels, Dwight E., 1993. "Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach," European Journal of Operational Research, Elsevier, vol. 64(2), pages 295-311, January.
    8. Christoph Schwindt & Jürgen Zimmermann, 2001. "A steepest ascent approach to maximizing the net present value of projects," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 53(3), pages 435-450, July.
    9. De Reyck, Bert & Herroelen, willy, 1998. "A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 111(1), pages 152-174, November.
    10. Mario Vanhoucke & Erik Demeulemeester & Willy Herroelen, 2001. "On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints," Management Science, INFORMS, vol. 47(8), pages 1113-1121, August.
    11. Yang, Kum Khiong & Tay, Lee Choo & Sum, Chee Chuong, 1995. "A comparison of stochastic scheduling rules for maximizing project net present value," European Journal of Operational Research, Elsevier, vol. 85(2), pages 327-339, September.
    12. W Herroelen & B De Reyck, 1999. "Phase transitions in project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 148-156, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. M. Vanhoucke, 2007. "A genetic algorithm to investigate the trade-off between project lead time and net present value," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 07/456, Ghent University, Faculty of Economics and Business Administration.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    2. Thomas Selle & Jürgen Zimmermann, 2003. "A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(2), pages 130-148, March.
    3. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    4. Kimms, Alf, 1999. "Lagrangean relaxation for scheduling projects under resource constraints to maximize the net present value," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 504, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Nursel Kavlak & Gündüz Ulusoy & Funda Sivrikaya Şerifoğlu & Ş. İlker Birbil, 2009. "Client‐contractor bargaining on net present value in project scheduling with limited resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 93-112, March.
    6. Huan Neng Chiu & Deng Maw Tsai, 2002. "An efficient search procedure for the resource-constrained multi-project scheduling problem with discounted cash flows," Construction Management and Economics, Taylor & Francis Journals, vol. 20(1), pages 55-66.
    7. Debels, D. & Vanhoucke, M., 2006. "Meta-Heuristic resource constrained project scheduling: solution space restrictions and neighbourhood extensions," Vlerick Leuven Gent Management School Working Paper Series 2006-18, Vlerick Leuven Gent Management School.
    8. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    9. Neumann, K. & Schwindt, C. & Zimmermann, J., 2003. "Order-based neighborhoods for project scheduling with nonregular objective functions," European Journal of Operational Research, Elsevier, vol. 149(2), pages 325-343, September.
    10. Vanhoucke, Mario & Demeulemeester, Erik & Herroelen, Willy, 2003. "Progress payments in project scheduling problems," European Journal of Operational Research, Elsevier, vol. 148(3), pages 604-620, August.
    11. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    12. Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.
    13. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    14. Wenhui Zhao & Nicholas G. Hall & Zhixin Liu, 2020. "Project Evaluation and Selection with Task Failures," Production and Operations Management, Production and Operations Management Society, vol. 29(2), pages 428-446, February.
    15. M. Vanhoucke, 2006. "An efficient hybrid search algorithm for various optimization problems," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/365, Ghent University, Faculty of Economics and Business Administration.
    16. V. Van Peteghem & M. Vanhoucke, 2009. "Using Resource Scarceness Characteristics to Solve the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/595, Ghent University, Faculty of Economics and Business Administration.
    17. D. Debels & M. Vanhoucke, 2006. "The impact of various activity assumptions on the lead-time and resource utilization of resource-constrained projects," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/385, Ghent University, Faculty of Economics and Business Administration.
    18. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    19. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    20. Leyman, Pieter & Vanhoucke, Mario, 2017. "Capital- and resource-constrained project scheduling with net present value optimization," European Journal of Operational Research, Elsevier, vol. 256(3), pages 757-776.

    More about this item

    Keywords

    Resource-constrained project scheduling; Net present value; Scatter search;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:rug:rugwps:06/417. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Nathalie Verhaeghe (email available below). General contact details of provider: https://edirc.repec.org/data/ferugbe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.