IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-0-387-33768-5_15.html
   My bibliography  Save this book chapter

Resource-Constrained Project Scheduling with Time Windows

In: Perspectives in Modern Project Scheduling

Author

Listed:
  • Klaus Neumann

    (University of Karlsruhe)

  • Christoph Schwindt

    (Clausthal University of Technology)

  • Jürgen Zimmermann

    (Clausthal University of Technology)

Abstract

Recent results on resource-constrained project scheduling with time windows are reviewed. General temporal constraints (resulting from minimum and maximum time lags between project activities), several different types of scarce resources, and a large variety of time-based, financial, and resource-based objective functions are considered. Emphasis is placed on an order-based structural analysis of the feasible region of project scheduling problems and a classification and discussion of objective functions important to practice, which can be exploited for constructing efficient solution procedures. After those structural issues, methods for solving time-constrained project scheduling problems are proposed. Next, the resolution of conflicts for renewable, allocatable, synchronizing, changeover, and cumulative resources and thus the solving of corresponding resource-constrained project scheduling problems are studied. Finally, new applications of resource-constrained project scheduling are presented: factory pick-up of new cars and batch scheduling in process industries.

Suggested Citation

  • Klaus Neumann & Christoph Schwindt & Jürgen Zimmermann, 2006. "Resource-Constrained Project Scheduling with Time Windows," International Series in Operations Research & Management Science, in: Joanna Józefowska & Jan Weglarz (ed.), Perspectives in Modern Project Scheduling, chapter 0, pages 375-407, Springer.
    • Handle: RePEc:spr:isochp:978-0-387-33768-5_15
    DOI: 10.1007/978-0-387-33768-5_15
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. 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:isochp:978-0-387-33768-5_15. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.