IDEAS home Printed from https://ideas.repec.org/a/spr/metrik/v20y2009i1p89-103.html
   My bibliography  Save this article

Zur optimalen Abfolge von Investitionsprojekten

Author

Listed:
  • Dominik Kramer

Abstract

If enterprises with limited capacities can carry out several long term projects, the question of the optimum order of these projects arises. A decisive criterion in analogy to the equivalent annuity leads to the optimal sequence. If temporal restrictions for the projects in the form of latest allowed completion dates exist, the optimum sequence can be calculated only with a non-linear model. This model can be transformed into a mixed-integer linear program and be solved with current software packages. Copyright Springer-Verlag 2009

Suggested Citation

  • Dominik Kramer, 2009. "Zur optimalen Abfolge von Investitionsprojekten," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 20(1), pages 89-103, May.
    • Handle: RePEc:spr:metrik:v:20:y:2009:i:1:p:89-103
    DOI: 10.1007/s00187-009-0069-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00187-009-0069-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00187-009-0069-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Klein, Robert & Scholl, Armin, 2004. "Planung und Entscheidung : Konzepte, Modelle und Methoden einer modernen betriebswirtschaftlichen Entscheidungsanalyse ; [unserem akademischen Lehrer Wolfgang Domschke zum 60. Geburtstag]," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 22645, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    3. 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.
    4. Alan S. Manne, 1960. "On the Job-Shop Scheduling Problem," Operations Research, INFORMS, vol. 8(2), pages 219-223, April.
    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. 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.
    2. Nalini Dayanand & Rema Padman, 2001. "Project Contracts and Payment Schedules: The Client's Problem," Management Science, INFORMS, vol. 47(12), pages 1654-1667, December.
    3. Sobel, Matthew J. & Szmerekovsky, Joseph G. & Tilson, Vera, 2009. "Scheduling projects with stochastic activity duration to maximize expected net present value," European Journal of Operational Research, Elsevier, vol. 198(3), pages 697-705, November.
    4. 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.
    5. 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.
    6. He, Zhengwen & Liu, Renjing & Jia, Tao, 2012. "Metaheuristics for multi-mode capital-constrained project payment scheduling," European Journal of Operational Research, Elsevier, vol. 223(3), pages 605-613.
    7. He, Zhengwen & Xu, Yu, 2008. "Multi-mode project payment scheduling problems with bonus-penalty structure," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1191-1207, September.
    8. 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.
    9. Etgar, Ran & Gelbard, Roy & Cohen, Yuval, 2017. "Optimizing version release dates of research and development long-term processes," European Journal of Operational Research, Elsevier, vol. 259(2), pages 642-653.
    10. 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.
    11. 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.
    12. Joseph G. Szmerekovsky, 2005. "The Impact of Contractor Behavior on the Client's Payment-Scheduling Problem," Management Science, INFORMS, vol. 51(4), pages 629-640, April.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    18. Wiesemann, Wolfram & Kuhn, Daniel & Rustem, Berç, 2010. "Maximizing the net present value of a project under uncertainty," European Journal of Operational Research, Elsevier, vol. 202(2), pages 356-367, April.
    19. Yangyang Liang & Nanfang Cui & Tian Wang & Erik Demeulemeester, 2019. "Robust resource-constrained max-NPV project scheduling with stochastic activity duration," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 219-254, March.
    20. 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.

    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:spr:metrik:v:20:y:2009:i:1:p:89-103. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.