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

A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem

Author

Listed:
  • Li, Yuchen
  • Saldanha-da-Gama, Francisco
  • Liu, Ming
  • Yang, Zaoli

Abstract

In this paper, a comprehensive production planning problem under uncertain demand is investigated. The problem intertwines two NP-hard optimization problems: an assembly line balancing problem and a capacitated lot-sizing problem. The problem is modelled as a two-stage stochastic program assuming a risk-averse decision maker. Efficient solution procedures are proposed for tackling the problem. A case study related to mask production is presented. Several insights are provided stemming from the COVID-19 pandemic. Finally, the results of a series of computational tests are reported.

Suggested Citation

  • Li, Yuchen & Saldanha-da-Gama, Francisco & Liu, Ming & Yang, Zaoli, 2023. "A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 304(1), pages 353-365.
    • Handle: RePEc:eee:ejores:v:304:y:2023:i:1:p:353-365
    DOI: 10.1016/j.ejor.2021.09.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721008195
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.09.043?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. Yves Pochet & Laurence A. Wolsey, 1991. "Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes," Management Science, INFORMS, vol. 37(1), pages 53-67, January.
    2. Kucukkoc, Ibrahim & Li, Zixiang & Karaoglan, Aslan D. & Zhang, David Z., 2018. "Balancing of mixed-model two-sided assembly lines with underground workstations: A mathematical model and ant colony optimization algorithm," International Journal of Production Economics, Elsevier, vol. 205(C), pages 228-243.
    3. Tiacci, Lorenzo & Mimmi, Mario, 2018. "Integrating ergonomic risks evaluation through OCRA index and balancing/sequencing decisions for mixed model stochastic asynchronous assembly lines," Omega, Elsevier, vol. 78(C), pages 112-138.
    4. Saravanan Venkatachalam & Arunachalam Narayanan, 2016. "Efficient formulation and heuristics for multi-item single source ordering problem with transportation cost," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4087-4103, July.
    5. Yılmaz Delice & Emel Kızılkaya Aydoğan & Uğur Özcan & Mehmet Sıtkı İlkay, 2017. "A modified particle swarm optimization algorithm to mixed-model two-sided assembly line balancing," Journal of Intelligent Manufacturing, Springer, vol. 28(1), pages 23-36, January.
    6. Fernández, Elena & Hinojosa, Yolanda & Puerto, Justo & Saldanha-da-Gama, Francisco, 2019. "New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation," European Journal of Operational Research, Elsevier, vol. 277(1), pages 215-226.
    7. Alan S. Manne, 1958. "Programming of Economic Lot Sizes," Management Science, INFORMS, vol. 4(2), pages 115-135, January.
    8. Tao Wu & Zhe Liang & Canrong Zhang, 2018. "Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 236-258, May.
    9. J. Behnamian & S.M.T. Fatemi Ghomi & B. Karimi & M. Fadaei Moludi, 2017. "A Markovian approach for multi-level multi-product multi-period capacitated lot-sizing problem with uncertainty in levels," International Journal of Production Research, Taylor & Francis Journals, vol. 55(18), pages 5330-5340, September.
    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. Romain Guillaume & Caroline Thierry & Paweł Zieliński, 2017. "Robust material requirement planning with cumulative demand under uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6824-6845, November.
    12. Bernard P. Dzielinski & Ralph E. Gomory, 1965. "Optimal Programming of Lot Sizes, Inventory and Labor Allocations," Management Science, INFORMS, vol. 11(9), pages 874-890, July.
    13. 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.
    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. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    2. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    3. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    4. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
    5. Hashemi-Petroodi, S. Ehsan & Thevenin, Simon & Kovalev, Sergey & Dolgui, Alexandre, 2023. "Markov decision process for multi-manned mixed-model assembly lines with walking workers," International Journal of Production Economics, Elsevier, vol. 255(C).
    6. S. Selcuk Erenguc & H. Murat Mercan, 1990. "A multifamily dynamic lot‐sizing model with coordinated replenishments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 539-558, August.
    7. Tom Vogel & Bernardo Almada-Lobo & Christian Almeder, 2017. "Integrated versus hierarchical approach to aggregate production planning and master production scheduling," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 193-229, January.
    8. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    9. Degraeve, Z. & Jans, R.F., 2003. "Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-026-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    10. Tao Wu & Zhe Liang & Canrong Zhang, 2018. "Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 236-258, May.
    11. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    12. Tao Wu, 2022. "Predictive Search for Capacitated Multi-Item Lot Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 385-406, January.
    13. Zeger Degraeve & Raf Jans, 2007. "A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times," Operations Research, INFORMS, vol. 55(5), pages 909-920, October.
    14. 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.
    15. Absi, Nabil & Kedad-Sidhoum, Safia, 2008. "The multi-item capacitated lot-sizing problem with setup times and shortage costs," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1351-1374, March.
    16. Bitran, Gabriel R. & Tirupati, Devanath., 1989. "Hierarchical production planning," Working papers 3017-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    17. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.
    18. Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
    19. Ö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.
    20. Toy, Ayhan Özgür & Berk, Emre, 2013. "Dynamic lot sizing for a warm/cold process: Heuristics and insights," International Journal of Production Economics, Elsevier, vol. 145(1), pages 53-66.

    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:304:y:2023:i:1:p:353-365. 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.