IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-642-04247-8_2.html
   My bibliography  Save this book chapter

Production and Operations Management: Models and Algorithms

In: Production and Inventory Management with Substitutions

Author

Listed:
  • J. Christian Lang

    (Technische Universität Darmstadt)

Abstract

This chapter intends to give an overview of the literature on dynamic lot-sizing models and stochastic transshipment models. These two types of models are used as a basis for developing models with substitution in the following chapters. Section 2.1 contains a classification of models for dynamic lot-sizing / production planning, and selected models. In Sect. 2.2, we give a brief overview of available methods for solving deterministic dynamic lot-sizing problems modeled using mixed-integer linear programming (MILP). Section 2.3 introduces transshipment problems and presents a classification scheme for transshipment models. Section 2.4 reviews selected solution approaches that can be applied to stochastic inventory control models such as transshipment problems.

Suggested Citation

  • J. Christian Lang, 2010. "Production and Operations Management: Models and Algorithms," Lecture Notes in Economics and Mathematical Systems, in: Production and Inventory Management with Substitutions, chapter 0, pages 9-79, Springer.
    • Handle: RePEc:spr:lnechp:978-3-642-04247-8_2
    DOI: 10.1007/978-3-642-04247-8_2
    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. Sitek Pawel & Wikarek Jaroslaw, 2014. "A Hybrid Method for the Modelling and Optimisation of Constrained Search Problems," Foundations of Management, Sciendo, vol. 5(3), pages 1-16, August.

    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:lnechp:978-3-642-04247-8_2. 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.