IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v186y2011i1p407-42710.1007-s10479-010-0788-9.html
   My bibliography  Save this article

Dismantling of nuclear power plants at optimal NPV

Author

Listed:
  • Jan-Hendrik Bartels
  • Thorsten Gather
  • Jürgen Zimmermann

Abstract

Today, worldwide far more than 100 nuclear power plants, which have been decommissioned in the recent years, are waiting for their complete dismantling. Since the dismantling of a single reactor causes costs of up to one billion Euros and lasts up to 15 years, the elaboration of a scheduling approach helping to optimize the net present value of a dismantling project seems to be worthwhile. In this paper we present a resource-constrained project scheduling approach optimizing the total discounted disbursements of dismantling a nuclear power plant. For the corresponding NP-hard optimization problem, we introduce an appropriate project scheduling model with minimum and maximum time lags, renewable and cumulative resources as well as multiple execution modes. To solve this model, we introduce a relaxation-based enumeration approach that delivers optimal solutions for problem instances containing up to 50 activities. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Jan-Hendrik Bartels & Thorsten Gather & Jürgen Zimmermann, 2011. "Dismantling of nuclear power plants at optimal NPV," Annals of Operations Research, Springer, vol. 186(1), pages 407-427, June.
    • Handle: RePEc:spr:annopr:v:186:y:2011:i:1:p:407-427:10.1007/s10479-010-0788-9
    DOI: 10.1007/s10479-010-0788-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0788-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0788-9?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. Böttcher, Jan & Drexl, A. & Kolisch, R. & Salewski, F., 1999. "Project scheduling under partially renewable resource constraints," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 345, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Kolisch, Rainer & Schwindt, Christoph & Sprecher, Arno, 1999. "Benchmark instances for project scheduling problems," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9500, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    3. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    4. 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)

    Citations

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


    Cited by:

    1. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.
    2. Xumai Qi & Dongdong Zhang & Hu Lu & Rupeng Li, 2023. "A GA-Based Scheduling Method for Civil Aircraft Distributed Production with Material Inventory Replenishment Consideration," Mathematics, MDPI, vol. 11(14), pages 1-25, July.
    3. Scherwath, Tim & Wealer, Ben & Mendelevitch, Roman, 2020. "Nuclear decommissioning after the German Nuclear Phase-Out an integrated view on new regulations and nuclear logistics," Energy Policy, Elsevier, vol. 137(C).
    4. Zdeněk Hanzálek & Přemysl Šůcha, 2017. "Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources," Annals of Operations Research, Springer, vol. 248(1), pages 209-237, January.

    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. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. Kai Watermeyer & Jürgen Zimmermann, 2022. "A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 575-602, June.
    3. Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre (Ed.), 2000. "Jahresbericht 1999," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 522, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Guidong Zhu & Jonathan F. Bard & Gang Yu, 2006. "A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 377-390, August.
    5. 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.
    6. Kai Watermeyer & Jürgen Zimmermann, 2020. "A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 427-460, June.
    7. Andreas Schirmer, 2000. "Case‐based reasoning and improved adaptive search for project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 201-222, April.
    8. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
    9. 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.
    10. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    11. Buddhakulsomsiri, Jirachai & Kim, David S., 2007. "Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting," European Journal of Operational Research, Elsevier, vol. 178(2), pages 374-390, April.
    12. Nissen, Rüdiger & Haase, Knut, 2004. "Duty-period-based network model for airline crew rescheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 581, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Bodenstein, Christian & Schryen, Guido & Neumann, Dirk, 2012. "Energy-aware workload management models for operation cost reduction in data centers," European Journal of Operational Research, Elsevier, vol. 222(1), pages 157-167.
    14. Alvarez-Valdes, R. & Crespo, E. & Tamarit, J.M. & Villa, F., 2008. "GRASP and path relinking for project scheduling under partially renewable resources," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1153-1170, September.
    15. Schirmer, Andreas & Potzahr, Kathrin, 2001. "Lehrgangsplanung für die Ausbildung von Verkehrsflugzeugführern: Ergebnisse einer Studie bei Lufthansa Flight Training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 538, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Ramírez Palencia, Alberto E. & Mejía Delgadillo, Gonzalo E., 2012. "A computer application for a bus body assembly line using Genetic Algorithms," International Journal of Production Economics, Elsevier, vol. 140(1), pages 431-438.
    17. Androutsopoulos, Konstantinos N. & Manousakis, Eleftherios G. & Madas, Michael A., 2020. "Modeling and solving a bi-objective airport slot scheduling problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 135-151.
    18. Zuo, Fei & Zio, Enrico & Xu, Yue, 2023. "Bi-objective optimization of the scheduling of risk-related resources for risk response," Reliability Engineering and System Safety, Elsevier, vol. 237(C).
    19. Bartsch, Thomas & Drexl, Andreas & Kröger, Stefan, 2002. "Schedulung European soccer leagues: Models, methods, and applications," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 557, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Mareike Karnebogen & Jürgen Zimmermann, 2024. "Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints," Annals of Operations Research, Springer, vol. 338(1), pages 173-192, July.

    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:annopr:v:186:y:2011:i:1:p:407-427:10.1007/s10479-010-0788-9. 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.