IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v311y2022i1d10.1007_s10479-019-03462-1.html
   My bibliography  Save this article

A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups

Author

Listed:
  • Sheng-I Chen

    (National Chiao Tung University)

  • Delvinia Su

    (National Chiao Tung University)

Abstract

We focus on the lot-sizing and scheduling problem with the additional considerations of machine eligibility, sequence-dependent setups, and uncertain demands. Multi-stage stochastic programming is proposed. We analyze the problem structure and suggest ways for modeling and solving large-scale stochastic integer programs. The analysis compares deterministic and stochastic model solutions to assess demand variance effects under the circumstances of increasing, fluctuating, and decreasing demands. The result shows that the expected cost performance of the stochastic programming model outperforms that of the deterministic model, in particular, when the demand is highly uncertain in the circumstance of an upward market trend. Our study can apply to the wafer fab manufacturing and other industries that heavily restricted by machine eligibility and demand uncertainties.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:311:y:2022:i:1:d:10.1007_s10479-019-03462-1
    DOI: 10.1007/s10479-019-03462-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03462-1
    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-019-03462-1?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. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    2. Albert Madansky, 1960. "Inequalities for Stochastic Linear Programming Problems," Management Science, INFORMS, vol. 6(2), pages 197-204, January.
    3. Christian Valente & Gautam Mitra & Mustapha Sadki & Robert Fourer, 2009. "Extending Algebraic Modelling Languages for Stochastic Programming," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 107-122, February.
    4. Guimarães, Luis & Klabjan, Diego & Almada-Lobo, Bernardo, 2014. "Modeling lotsizing and scheduling problems with sequence dependent setups," European Journal of Operational Research, Elsevier, vol. 239(3), pages 644-662.
    5. Fleischmann, B. & Meyr, H., 1997. "The General Lotsizing and Scheduling Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36068, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    6. 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.
    7. Wolsey, L. A., 1997. "MIP modelling of changeovers in production planning and scheduling problems," LIDAM Reprints CORE 1271, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Suerie, Christopher, 2006. "Modeling of period overlapping setup times," European Journal of Operational Research, Elsevier, vol. 174(2), pages 874-886, October.
    9. 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.
    10. Wolsey, Laurence A., 1997. "MIP modelling of changeovers in production planning and scheduling problems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 154-165, May.
    11. John R. Birge, 1985. "Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs," Operations Research, INFORMS, vol. 33(5), pages 989-1007, October.
    12. Kangbok Lee & Joseph Leung & Michael Pinedo, 2013. "Makespan minimization in online scheduling with machine eligibility," Annals of Operations Research, Springer, vol. 204(1), pages 189-222, April.
    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.
    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. Lee, Younsoo & Lee, Kyungsik, 2022. "New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 302(1), pages 230-243.
    2. 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.
    3. Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    4. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-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.
    5. Masoumeh Mahdieh & Alistair Clark & Mehdi Bijari, 2018. "A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 884-923, December.
    6. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    7. 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.
    8. Bredstrom, David & Lundgren, Jan T. & Ronnqvist, Mikael & Carlsson, Dick & Mason, Andrew, 2004. "Supply chain optimization in the pulp mill industry--IP models, column generation and novel constraint branches," European Journal of Operational Research, Elsevier, vol. 156(1), pages 2-22, July.
    9. Mac Cawley, Alejandro & Maturana, Sergio & Pascual, Rodrigo & Tortorella, Guilherme Luz, 2022. "Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: Robust formulation and a decomposition solution approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 819-839.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. Guimarães, Luis & Klabjan, Diego & Almada-Lobo, Bernardo, 2014. "Modeling lotsizing and scheduling problems with sequence dependent setups," European Journal of Operational Research, Elsevier, vol. 239(3), pages 644-662.
    15. Matthias Gerhard Wichmann & Christoph Johannes & Thomas Stefan Spengler, 2019. "An extension of the general lot-sizing and scheduling problem (GLSP) with time-dependent energy prices," Journal of Business Economics, Springer, vol. 89(5), pages 481-514, July.
    16. Lukac, Zrinka & Soric, Kristina & Rosenzweig, Visnja Vojvodic, 2008. "Production planning problem with sequence dependent setups as a bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1504-1512, June.
    17. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    18. Lee, Younsoo & Lee, Kyungsik, 2023. "Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 310(1), pages 201-216.
    19. Martínez, Karim Pérez & Morabito, Reinaldo & Toso, Eli Angela Vitor, 2018. "A coupled process configuration, lot-sizing and scheduling model for production planning in the molded pulp industry," International Journal of Production Economics, Elsevier, vol. 204(C), pages 227-243.
    20. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.

    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:311:y:2022:i:1:d:10.1007_s10479-019-03462-1. 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.