IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v344y2025i2d10.1007_s10479-023-05741-4.html
   My bibliography  Save this article

Multi-stage scenario-based stochastic programming for managing lot sizing and workforce scheduling at Vestel

Author

Listed:
  • Seyed Amin Seyfi

    (Ozyegin University)

  • İhsan Yanıkoğlu

    (Ozyegin University)

  • Görkem Yılmaz

    (Izmir University of Economics
    R &D, Vestel Home Appliances)

Abstract

This study proposes a multi-stage stochastic production planning approach for a joint lot sizing and workforce scheduling problem under demand uncertainty. Scenario trees are used to model uncertainty in demand, and a multi-stage scenario-based stochastic linear program is developed. This model allows for both here-and-now and wait-and-see decisions providing flexibility for decision-makers to adjust production quantities according to the realized portion of demand and improve the overall effectiveness of production planning by better managing the number of active lines, workforce, and inventory levels. A matheuristic is developed for large-sized instances, which yields near-optimal solutions in practicable computation times. The proposed methods are demonstrated over a real data set taken from a Turkish home and professional appliances company, Vestel. The results show significant improvements in cost and CPU time performances for benchmark approaches, verifying the effectiveness of the proposed method.

Suggested Citation

  • Seyed Amin Seyfi & İhsan Yanıkoğlu & Görkem Yılmaz, 2025. "Multi-stage scenario-based stochastic programming for managing lot sizing and workforce scheduling at Vestel," Annals of Operations Research, Springer, vol. 344(2), pages 911-936, January.
    • Handle: RePEc:spr:annopr:v:344:y:2025:i:2:d:10.1007_s10479-023-05741-4
    DOI: 10.1007/s10479-023-05741-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05741-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05741-4?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. Hu, Zhengyang & Hu, Guiping, 2020. "Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties," European Journal of Operational Research, Elsevier, vol. 284(2), pages 485-497.
    2. S C H Leung & Y Wu & K K Lai, 2006. "A stochastic programming approach for multi-site aggregate production planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 123-132, February.
    3. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    4. Lusa, Amaia & Corominas, Albert & Muñoz, Norberto, 2008. "A multistage scenario optimisation procedure to plan annualised working hours under demand uncertainty," International Journal of Production Economics, Elsevier, vol. 113(2), pages 957-968, June.
    5. 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.
    6. Ruihai Li & Jinn-Tsair Teng & Chun-Tao Chang, 2021. "Lot-sizing and pricing decisions for perishable products under three-echelon supply chains when demand depends on price and stock-age," Annals of Operations Research, Springer, vol. 307(1), pages 303-328, December.
    7. François Larroche & Odile Bellenguez & Guillaume Massonnet, 2022. "Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups," International Journal of Production Research, Taylor & Francis Journals, vol. 60(21), pages 6573-6596, November.
    8. 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.
    9. Gislaine Mara Melega & Silvio Alexandre de Araujo & Reinaldo Morabito, 2020. "Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems," Annals of Operations Research, Springer, vol. 295(2), pages 695-736, December.
    10. Curcio, Eduardo & Amorim, Pedro & Zhang, Qi & Almada-Lobo, Bernardo, 2018. "Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty," International Journal of Production Economics, Elsevier, vol. 202(C), pages 81-96.
    11. Hu, Zhengyang & Hu, Guiping, 2016. "A two-stage stochastic programming model for lot-sizing and scheduling under uncertainty," International Journal of Production Economics, Elsevier, vol. 180(C), pages 198-207.
    12. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    13. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    14. 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.
    Full references (including those not matched with items on IDEAS)

    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. Schlenkrich, Manuel & Parragh, Sophie N., 2024. "Capacitated multi-item multi-echelon lot sizing with setup carry-over under uncertain demand," International Journal of Production Economics, Elsevier, vol. 277(C).
    2. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    3. Sheng-I Chen & Delvinia Su, 2022. "A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups," Annals of Operations Research, Springer, vol. 311(1), pages 35-50, April.
    4. Zeiträg, Yannik & Figueira, José Rui & Pereira, Miguel Alves, 2024. "A web-based interactive decision support system for a multi-objective lot-sizing and production scheduling model," International Journal of Production Economics, Elsevier, vol. 271(C).
    5. Gislaine Mara Melega & Silvio Alexandre de Araujo & Raf Jans & Reinaldo Morabito, 2023. "Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups," Flexible Services and Manufacturing Journal, Springer, vol. 35(4), pages 1276-1312, December.
    6. LAMAS, ALEJANDRO & CHEVALIER, Philippe, 2013. "Jumping the hurdles for collaboration: fairness in operations pooling in the absence of transfer payments," LIDAM Discussion Papers CORE 2013073, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    8. Oliveira, Washington A. & Fiorotto, Diego J. & Song, Xiang & Jones, Dylan F., 2021. "An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 996-1007.
    9. Wolter, Anja & Helber, Stefan, 2013. "Simultaneous Production and Maintenance Planning for a Single Capacitated Resource facing both a Dynamic Demand and Intensive Wear and Tear," Hannover Economic Papers (HEP) dp-522, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    10. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    11. Lamas, Alejandro & Chevalier, Philippe, 2018. "Joint dynamic pricing and lot-sizing under competition," European Journal of Operational Research, Elsevier, vol. 266(3), pages 864-876.
    12. Carvalho, Desiree M. & Nascimento, Mariá C.V., 2022. "Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup," European Journal of Operational Research, Elsevier, vol. 296(1), pages 158-173.
    13. Simon Thevenin & Yossiri Adulyasak & Jean-François Cordeau, 2022. "Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3151-3169, November.
    14. Kian, Ramez & Gürler, Ülkü & Berk, Emre, 2014. "The dynamic lot-sizing problem with convex economic production costs and setups," International Journal of Production Economics, Elsevier, vol. 155(C), pages 361-379.
    15. 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.
    16. Xu, Haoxuan & Gong, Yeming (Yale) & Chu, Chengbin & Zhang, Jinlong, 2017. "Dynamic lot-sizing models for retailers with online channels," International Journal of Production Economics, Elsevier, vol. 183(PA), pages 171-184.
    17. Dziuba, Daryna & Almeder, Christian, 2023. "New construction heuristic for capacitated lot sizing problems," European Journal of Operational Research, Elsevier, vol. 311(3), pages 906-920.
    18. 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).
    19. K. A. G. Araujo & E. G. Birgin & M. S. Kawamura & D. P. Ronconi, 2023. "Relax-and-Fix Heuristics Applied to a Real-World Lot Sizing and Scheduling Problem in the Personal Care Consumer Goods Industry," SN Operations Research Forum, Springer, vol. 4(2), pages 1-30, June.
    20. Hartmut Stadtler & Nikolai Heinrichs, 2024. "Multi-period descriptive sampling for scenario generation applied to the stochastic capacitated lot-sizing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 639-668, September.

    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:annopr:v:344:y:2025:i:2:d:10.1007_s10479-023-05741-4. 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: 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.