IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v56y2003i3p513-533.html
   My bibliography  Save this article

Project scheduling with inventory constraints

Author

Listed:
  • Klaus Neumann
  • Christoph Schwindt

Abstract

Inventory constraints refer to so-called cumulative resources, which can store a single or several different products and have a prescribed minimum and maximum inventory, where the inventory is depleted and replenished over time. Some additional applications of cumulative resources, e.g. to investment projects, are also discussed in this paper. We study some properties of the feasible region of the project scheduling problem with inventory constraints and general temporal constraints and especially show how to resolve so-called resource conflicts. The feasible region represents the intersection of a union of polyhedral cones with the polyhedron of time-feasible solutions. These results can be exploited for constructing an efficient branch-and-bound algorithm which enumerates alternatives to avoid stock shortage and surplus by introducing precedence constraints between disjoint sets of events. Finally, we sketch how the procedure can be truncated to a filtered beam search heuristic. An experimental performance analysis shows that problem instances with 100 events and five cumulative resources can be solved in less than one minute. Copyright Springer-Verlag Berlin Heidelberg 2003

Suggested Citation

  • Klaus Neumann & Christoph Schwindt, 2003. "Project scheduling with inventory constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(3), pages 513-533, January.
    • Handle: RePEc:spr:mathme:v:56:y:2003:i:3:p:513-533
    DOI: 10.1007/s001860200251
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200251
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860200251?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.

    Citations

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


    Cited by:

    1. Györgyi, Péter & Kis, Tamás, 2017. "Approximation schemes for parallel machine scheduling with non-renewable resources," European Journal of Operational Research, Elsevier, vol. 258(1), pages 113-123.
    2. Sandra Ulrich Ngueveu & Christian Artigues & Nabil Absi & Safia Kedad-Sidhoum, 2022. "Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs," Journal of Heuristics, Springer, vol. 28(1), pages 93-120, February.
    3. Davari, Morteza & Ranjbar, Mohammad & De Causmaecker, Patrick & Leus, Roel, 2020. "Minimizing makespan on a single machine with release dates and inventory constraints," European Journal of Operational Research, Elsevier, vol. 286(1), pages 115-128.
    4. Sciau, Jean-Baptiste & Goyon, Agathe & Sarazin, Alexandre & Bascans, Jérémy & Prud’homme, Charles & Lorca, Xavier, 2024. "Using constraint programming to address the operational aircraft line maintenance scheduling problem," Journal of Air Transport Management, Elsevier, vol. 115(C).
    5. van der Beek, T. & Souravlias, D. & van Essen, J.T. & Pruyn, J. & Aardal, K., 2024. "Hybrid differential evolution algorithm for the resource constrained project scheduling problem with a flexible project structure and consumption and production of resources," European Journal of Operational Research, Elsevier, vol. 313(1), pages 92-111.

    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:mathme:v:56:y:2003:i:3:p:513-533. 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.