IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v34y1988i9p1096-1108.html
   My bibliography  Save this article

Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints

Author

Listed:
  • James H. Bookbinder

    (Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1)

  • Jin-Yan Tan

    (Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1)

Abstract

We formulate a stochastic-demand version of the single-stage lot-sizing problem with time-varying demand, incorporating a service-level constraint on the probability of a stockout. Three strategies are studied. The "static uncertainty" strategy, in which lot-sizing decisions for every period must be made at the beginning of period 1, is shown to yield an equivalent deterministic problem with time-varying demands for which optimal or good heuristic solutions exist. The procedure by which this equivalent problem is obtained is computationally simple. The "dynamic uncertainty" strategy allows subsequent lot sizes to be chosen on the basis of demands that have become known at a later point in time. The "static-dynamic" uncertainty approach combines features of the above two strategies and yields an equivalent linear program for any given order schedule. Relationships are suggested between these strategies and various aspects of rolling horizon production planning. Arguments are given that in such an environment, the static uncertainty strategy is the most straightforward to modify and "roll along" as new demands become known. Good results are found when this procedure is applied to some 300-period stochastic-demand problems using rolling horizons of between 2 and 12 periods in length.

Suggested Citation

  • James H. Bookbinder & Jin-Yan Tan, 1988. "Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints," Management Science, INFORMS, vol. 34(9), pages 1096-1108, September.
  • Handle: RePEc:inm:ormnsc:v:34:y:1988:i:9:p:1096-1108
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.34.9.1096
    Download Restriction: no

    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:inm:ormnsc:v:34:y:1988:i:9:p:1096-1108. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.