IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v127y2000i2p425-443.html
   My bibliography  Save this article

Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints

Author

Listed:
  • Neumann, K.
  • Zimmermann, J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Neumann, K. & Zimmermann, J., 2000. "Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints," European Journal of Operational Research, Elsevier, vol. 127(2), pages 425-443, December.
    • Handle: RePEc:eee:ejores:v:127:y:2000:i:2:p:425-443
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00498-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. A. H. Russell, 1970. "Cash Flows in Networks," Management Science, INFORMS, vol. 16(5), pages 357-373, January.
    2. Erik Demeulemeester, 1995. "Minimizing Resource Availability Costs in Time-Limited Project Networks," Management Science, INFORMS, vol. 41(10), pages 1590-1598, October.
    3. Bandelloni, M. & Tucci, M. & Rinaldi, R., 1994. "Optimal resource leveling using non-serial dyanamic programming," European Journal of Operational Research, Elsevier, vol. 78(2), pages 162-177, October.
    4. 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.
    5. Neumann, K. & Zimmermann, J., 1999. "Resource levelling for projects with schedule-dependent time windows," European Journal of Operational Research, Elsevier, vol. 117(3), pages 591-605, September.
    6. Tavares, L. Valadares, 1987. "Optimal resource profiles for program scheduling," European Journal of Operational Research, Elsevier, vol. 29(1), pages 83-90, April.
    7. K. Neumann & H. Nübel & C. Schwindt, 2000. "Active and stable project scheduling," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 441-465, December.
    8. Oya Icmeli & S. Selcuk Erenguc, 1996. "A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows," Management Science, INFORMS, vol. 42(10), pages 1395-1408, October.
    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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    9. 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.
    10. Kreter, Stefan & Schutt, Andreas & Stuckey, Peter J. & Zimmermann, Jürgen, 2018. "Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 472-486.
    11. 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.
    12. 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.
    13. 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).
    14. Joseph G. Szmerekovsky & George L. Vairaktarakis, 2006. "Maximizing project cash availability," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 272-284, June.
    15. 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.
    16. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    17. 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.
    18. 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.
    19. Yuvraj Gajpal & Ashraf Elazouni, 2015. "Enhanced heuristic for finance-based scheduling of construction projects," Construction Management and Economics, Taylor & Francis Journals, vol. 33(7), pages 531-553, July.
    20. Ulusoy, Gunduz & Cebelli, Serkan, 2000. "An equitable approach to the payment scheduling problem in project management," European Journal of Operational Research, Elsevier, vol. 127(2), pages 262-278, December.

    More about this item

    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:eee:ejores:v:127:y:2000:i:2:p:425-443. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.