IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v188y2008i3p705-722.html
   My bibliography  Save this article

Augmenting the lot sizing order quantity when demand is probabilistic

Author

Listed:
  • Pujawan, I Nyoman
  • Silver, Edward A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Pujawan, I Nyoman & Silver, Edward A., 2008. "Augmenting the lot sizing order quantity when demand is probabilistic," European Journal of Operational Research, Elsevier, vol. 188(3), pages 705-722, August.
    • Handle: RePEc:eee:ejores:v:188:y:2008:i:3:p:705-722
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00437-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Nyoman Pujawan, I, 2004. "The effect of lot sizing rules on order variability," European Journal of Operational Research, Elsevier, vol. 159(3), pages 617-635, December.
    3. Tarim, S. Armagan & Kingsman, Brian G., 2004. "The stochastic dynamic production/inventory lot-sizing problem with service-level constraints," International Journal of Production Economics, Elsevier, vol. 88(1), pages 105-119, March.
    4. Dellaert, N. P. & Melo, M. T., 2003. "Approximate solutions for a stochastic lot-sizing problem with partial customer-order information," European Journal of Operational Research, Elsevier, vol. 150(1), pages 163-180, October.
    5. Richard Ehrhardt, 1979. "The Power Approximation for Computing (s, S) Inventory Policies," Management Science, INFORMS, vol. 25(8), pages 777-786, August.
    6. De Bodt, Marc A. & Van Wassenhove, Luk N. & Gelders, Ludo F., 1982. "Lot sizing and safety stock decisions in an MRP system with demand uncertainty," Engineering Costs and Production Economics, Elsevier, vol. 6(1), pages 67-75, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    2. Govindan, Kannan, 2015. "The optimal replenishment policy for time-varying stochastic demand under vendor managed inventory," European Journal of Operational Research, Elsevier, vol. 242(2), pages 402-423.
    3. Pauls-Worm, Karin G.J. & Hendrix, Eligius M.T. & Haijema, René & van der Vorst, Jack G.A.J., 2014. "An MILP approximation for ordering perishable products with non-stationary demand and service level constraints," International Journal of Production Economics, Elsevier, vol. 157(C), pages 133-146.
    4. Roberto Rossi & S. Tarim & Brahim Hnich & Steven Prestwich, 2012. "Constraint programming for stochastic inventory systems under shortage cost," Annals of Operations Research, Springer, vol. 195(1), pages 49-71, May.
    5. Rossi, Roberto & Tarim, S. Armagan & Hnich, Brahim & Prestwich, Steven, 2011. "A state space augmentation algorithm for the replenishment cycle inventory policy," International Journal of Production Economics, Elsevier, vol. 133(1), pages 377-384, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    2. Govindan, Kannan, 2015. "The optimal replenishment policy for time-varying stochastic demand under vendor managed inventory," European Journal of Operational Research, Elsevier, vol. 242(2), pages 402-423.
    3. Tarim, S. Armagan & Smith, Barbara M., 2008. "Constraint programming for computing non-stationary (R, S) inventory policies," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1004-1021, September.
    4. Dural-Selcuk, Gozdem & Rossi, Roberto & Kilic, Onur A. & Tarim, S. Armagan, 2020. "The benefit of receding horizon control: Near-optimal policies for stochastic inventory control," Omega, Elsevier, vol. 97(C).
    5. Özen, Ulaş & Doğru, Mustafa K. & Armagan Tarim, S., 2012. "Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem," Omega, Elsevier, vol. 40(3), pages 348-357.
    6. Kilic, Onur A. & Tunc, Huseyin & Tarim, S. Armagan, 2018. "Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1102-1109.
    7. Visentin, Andrea & Prestwich, Steven & Rossi, Roberto & Tarim, S. Armagan, 2021. "Computing optimal (R,s,S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming," European Journal of Operational Research, Elsevier, vol. 294(1), pages 91-99.
    8. Gurkan, M. Edib & Tunc, Huseyin & Tarim, S. Armagan, 2022. "The joint stochastic lot sizing and pricing problem," Omega, Elsevier, vol. 108(C).
    9. Tempelmeier, Horst, 2007. "On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 181(1), pages 184-194, August.
    10. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2021. "The value of aggregate service levels in stochastic lot sizing problems," Omega, Elsevier, vol. 102(C).
    11. Céline Gicquel & Jianqiang Cheng, 2018. "A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand," Annals of Operations Research, Springer, vol. 264(1), pages 123-155, May.
    12. Xiang, Mengyuan & Rossi, Roberto & Martin-Barragan, Belen & Tarim, S. Armagan, 2023. "A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand," European Journal of Operational Research, Elsevier, vol. 304(2), pages 515-524.
    13. Ma, Xiyuan & Rossi, Roberto & Archibald, Thomas Welsh, 2022. "Approximations for non-stationary stochastic lot-sizing under (s,Q)-type policy," European Journal of Operational Research, Elsevier, vol. 298(2), pages 573-584.
    14. Rossi, Roberto & Tarim, S. Armagan & Hnich, Brahim & Prestwich, Steven, 2010. "Computing the non-stationary replenishment cycle inventory policy under stochastic supplier lead-times," International Journal of Production Economics, Elsevier, vol. 127(1), pages 180-189, September.
    15. Pauls-Worm, Karin G.J. & Hendrix, Eligius M.T. & Alcoba, Alejandro G. & Haijema, René, 2016. "Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint," International Journal of Production Economics, Elsevier, vol. 181(PA), pages 238-246.
    16. Huseyin Tunc & Onur A. Kilic & S. Armagan Tarim & Roberto Rossi, 2018. "An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 492-506, August.
    17. Roberto Rossi & S. Tarim & Brahim Hnich & Steven Prestwich, 2012. "Constraint programming for stochastic inventory systems under shortage cost," Annals of Operations Research, Springer, vol. 195(1), pages 49-71, May.
    18. Roberto Rossi & S. Armagan Tarim & Ramesh Bollapragada, 2012. "Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 66-80, February.
    19. Xiang, Mengyuan & Rossi, Roberto & Martin-Barragan, Belen & Tarim, S. Armagan, 2018. "Computing non-stationary (s, S) policies using mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 271(2), pages 490-500.
    20. Liu, Kanglin & Zhang, Zhi-Hai, 2018. "Capacitated disassembly scheduling under stochastic yield and demand," European Journal of Operational Research, Elsevier, vol. 269(1), pages 244-257.

    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:eee:ejores:v:188:y:2008:i:3:p:705-722. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.