IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v102y2021ics0305048320306897.html
   My bibliography  Save this article

The value of aggregate service levels in stochastic lot sizing problems

Author

Listed:
  • Sereshti, Narges
  • Adulyasak, Yossiri
  • Jans, Raf

Abstract

Dealing with demand uncertainty in multi-item lot sizing problems poses huge challenges due to the inherent complexity. The resulting stochastic formulations typically determine production plans which minimize the expected total operating cost while ensuring that a predefined service level constraint for each product is satisfied. We extend these stochastic formulations to a more general setting where, in addition to the individual service level constraints, an aggregate service level constraint is also imposed. Such a situation is relevant in practical applications where the service level aggregated from a variety of products must be collectively satisfied. These extended formulations allow the decision maker to flexibly assign different individual service levels to different products while ensuring that the overall aggregate service level is satisfied and these aggregate service level measures can be used in conjunction with the commonly adopted individual service levels. Different mathematical formulations are proposed for this problem with different types of service levels. These formulations are a piece-wise linear approximation for the β, γ, and δ service levels and a quantile-based formulation for the αc service level. We also present a receding horizon implementation of the proposed formulations which can be effectively used in a dynamic environment. Computational experiments are conducted to analyze the impact of aggregate service levels and demonstrate the value of the proposed formulations as opposed to standard service levels imposed on individual items.

Suggested Citation

  • Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2021. "The value of aggregate service levels in stochastic lot sizing problems," Omega, Elsevier, vol. 102(C).
    • Handle: RePEc:eee:jomega:v:102:y:2021:i:c:s0305048320306897
    DOI: 10.1016/j.omega.2020.102335
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048320306897
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2020.102335?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.

    References listed on IDEAS

    as
    1. 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.
    2. Tunc, Huseyin & Kilic, Onur A. & Tarim, S. Armagan & Eksioglu, Burak, 2013. "A simple approach for assessing the cost of system nervousness," International Journal of Production Economics, Elsevier, vol. 141(2), pages 619-625.
    3. Gruson, Matthieu & Cordeau, Jean-François & Jans, Raf, 2018. "The impact of service level constraints in deterministic lot sizing with backlogging," Omega, Elsevier, vol. 79(C), pages 91-103.
    4. 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.
    5. Kelle, Peter, 1989. "Optimal service levels in multi-item inventory systems," Engineering Costs and Production Economics, Elsevier, vol. 15(1), pages 375-379, May.
    6. Horst Tempelmeier, 2013. "Stochastic Lot Sizing Problems," International Series in Operations Research & Management Science, in: J. MacGregor Smith & Barış Tan (ed.), Handbook of Stochastic Models and Analysis of Manufacturing System Operations, edition 127, chapter 0, pages 313-344, Springer.
    7. Tempelmeier, Horst & Herpers, Sascha, 2011. "Dynamic uncapacitated lot sizing with random demand under a fillrate constraint," European Journal of Operational Research, Elsevier, vol. 212(3), pages 497-507, August.
    8. Hartmut Stadtler & Malte Meistering, 2019. "Model formulations for the capacitated lot-sizing problem with service-level constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 1025-1056, December.
    9. 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.
    10. 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.
    11. Yuchen Jiang & Juan Xu & Siqian Shen & Cong Shi, 2017. "Production planning problems with joint service-level guarantee: a computational study," International Journal of Production Research, Taylor & Francis Journals, vol. 55(1), pages 38-58, January.
    12. Dinakar Gade & Simge Küçükyavuz, 2013. "Formulations for dynamic lot sizing with service levels," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(2), pages 87-101, March.
    13. Mula, J. & Poler, R. & Garcia-Sabater, J.P. & Lario, F.C., 2006. "Models for production planning under uncertainty: A review," International Journal of Production Economics, Elsevier, vol. 103(1), pages 271-285, September.
    14. Tempelmeier, Horst, 2011. "A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint," Omega, Elsevier, vol. 39(6), pages 627-633, December.
    15. Rossi, Roberto & Kilic, Onur A. & Tarim, S. Armagan, 2015. "Piecewise linear approximations for the static–dynamic uncertainty strategy in stochastic lot-sizing," Omega, Elsevier, vol. 50(C), pages 126-140.
    16. 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.
    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. Bikash Koli Dey & Hyesung Seok, 2024. "Intelligent inventory management with autonomation and service strategy," Journal of Intelligent Manufacturing, Springer, vol. 35(1), pages 307-330, January.
    2. Alexandre Forel & Martin Grunow, 2023. "Dynamic stochastic lot sizing with forecast evolution in rolling‐horizon planning," Production and Operations Management, Production and Operations Management Society, vol. 32(2), pages 449-468, February.

    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. Rossi, Roberto & Kilic, Onur A. & Tarim, S. Armagan, 2015. "Piecewise linear approximations for the static–dynamic uncertainty strategy in stochastic lot-sizing," Omega, Elsevier, vol. 50(C), pages 126-140.
    3. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2024. "Managing flexibility in stochastic multi-level lot sizing problem with service level constraints," Omega, Elsevier, vol. 122(C).
    4. Gruson, Matthieu & Cordeau, Jean-François & Jans, Raf, 2021. "Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure," European Journal of Operational Research, Elsevier, vol. 291(1), pages 206-217.
    5. 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.
    6. 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.
    7. Taş, Duygu & Gendreau, Michel & Jabali, Ola & Jans, Raf, 2019. "A capacitated lot sizing problem with stochastic setup times and overtime," European Journal of Operational Research, Elsevier, vol. 273(1), pages 146-159.
    8. 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).
    9. Choudhary, Devendra & Shankar, Ravi, 2015. "The value of VMI beyond information sharing in a single supplier multiple retailers supply chain under a non-stationary (Rn, Sn) policy," Omega, Elsevier, vol. 51(C), pages 59-70.
    10. Ö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.
    11. 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.
    12. 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.
    13. Gurkan, M. Edib & Tunc, Huseyin & Tarim, S. Armagan, 2022. "The joint stochastic lot sizing and pricing problem," Omega, Elsevier, vol. 108(C).
    14. Metzker Soares, Paula & Thevenin, Simon & Adulyasak, Yossiri & Dolgui, Alexandre, 2024. "Adaptive robust optimization for lot-sizing under yield uncertainty," European Journal of Operational Research, Elsevier, vol. 313(2), pages 513-526.
    15. 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.
    16. 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.
    17. 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.
    18. Hadi Farhangi, 2021. "Multi-Echelon Supply Chains with Lead Times and Uncertain Demands," SN Operations Research Forum, Springer, vol. 2(3), pages 1-25, September.
    19. Stefano Coniglio & Arie M. C. A. Koster & Nils Spiekermann, 2018. "Lot sizing with storage losses under demand uncertainty," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 763-788, October.
    20. Koca, Esra & Yaman, Hande & Selim Aktürk, M., 2015. "Stochastic lot sizing problem with controllable processing times," Omega, Elsevier, vol. 53(C), pages 1-10.

    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:jomega:v:102:y:2021:i:c:s0305048320306897. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.