IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i16p4903-4916.html
   My bibliography  Save this article

On the economic lot scheduling problem: stock-out prevention and system feasibility

Author

Listed:
  • Brian B. Hanson
  • Thom J. Hodgson
  • Michael G. Kay
  • Russell E. King
  • Kristin A. Thoney-Barletta

Abstract

The Economic Lot Scheduling Problem is a classical scheduling problem with the objective of minimising the long-run inventory and set-up costs of a single machine, multi-product inventory system. Demand rates, production rates and set-up times are assumed to be deterministic. The problem has been extensively studied and methods exist to obtain cyclic schedules which minimise total cost. In order to apply a cyclic schedule without a stock-out occurring, certain initial inventory levels are required. This paper considers the scenario where inventory levels are critically low and the cyclic schedule cannot be applied. Analytical methods are developed to determine: if the initial inventory is sufficient to prevent a stock-out from occurring; the maximum time until a stock-out will occur if a stock-out is unavoidable; and the minimum time required to obtain the necessary inventory to resume the cyclic schedule if a stock-out can be avoided.

Suggested Citation

  • Brian B. Hanson & Thom J. Hodgson & Michael G. Kay & Russell E. King & Kristin A. Thoney-Barletta, 2015. "On the economic lot scheduling problem: stock-out prevention and system feasibility," International Journal of Production Research, Taylor & Francis Journals, vol. 53(16), pages 4903-4916, August.
  • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:16:p:4903-4916
    DOI: 10.1080/00207543.2015.1005246
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1005246
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2015.1005246?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:53:y:2015:i:16:p:4903-4916. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.