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

Lot-sizing and scheduling in flat-panel display manufacturing process

Author

Listed:
  • Lee, Younsoo
  • Lee, Kyungsik

Abstract

In this paper, we consider a lot-sizing and scheduling problem arising in the real-world flat-panel display industry. This problem is formulated as a variant of the discrete lot-sizing and scheduling problem with a sequence-dependent setup. After describing the characteristics of the problem and analyzing its computational complexity, we propose an extended formulation based on a network structure. Even though the problem is NP-hard in general, we show that there exist special cases solvable in polynomial time. For the general cases, we demonstrate the tightness of the extended formulation by means of both polyhedral analysis and computational experiments with artificially generated data and real-world industry data. We also propose a relax-and-fix heuristic algorithm based on the extended formulation, which has been deployed in practice, with the corresponding computational results.

Suggested Citation

  • Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    • Handle: RePEc:eee:jomega:v:93:y:2020:i:c:s0305048318311873
    DOI: 10.1016/j.omega.2019.02.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048318311873
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2019.02.005?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. Gary D. Eppen & R. Kipp Martin, 1987. "Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition," Operations Research, INFORMS, vol. 35(6), pages 832-848, December.
    2. 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.
    3. Fleischmann, Bernhard, 1994. "The discrete lot-sizing and scheduling problem with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 75(2), pages 395-404, June.
    4. Meyr, H., 2000. "Simultaneous Lotsizing and Scheduling by combining Local Search with Dual Reoptimization," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 39380, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    5. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.
    6. Márcio AF Belo-Filho & Franklina MB Toledo & Bernardo Almada-Lobo, 2014. "Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(11), pages 1735-1747, November.
    7. Wei, Wenchao & Guimarães, Luis & Amorim, Pedro & Almada-Lobo, Bernardo, 2017. "Tactical production and distribution planning with dependency issues on the production process," Omega, Elsevier, vol. 67(C), pages 99-114.
    8. BELVAUX, Gaetan & WOLSEY, Laurence A., 2001. "Modelling practical lot-sizing problems as mixed-integer programs," LIDAM Reprints CORE 1516, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. WOLSEY, Laurence A., 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," LIDAM Reprints CORE 1605, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. 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).
    11. WOLSEY, Laurence, 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," LIDAM Discussion Papers CORE 2002012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. 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.
    13. Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
    14. Andrew J. Miller & Laurence A. Wolsey, 2003. "Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems," Operations Research, INFORMS, vol. 51(4), pages 557-565, August.
    15. Salomon, Marc & Solomon, Marius M. & Van Wassenhove, Luk N. & Dumas, Yvan & Dauzere-Peres, Stephane, 1997. "Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows," European Journal of Operational Research, Elsevier, vol. 100(3), pages 494-513, August.
    16. van Hoesel, Stan & Kolen, Antoon, 1994. "A linear description of the discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 75(2), pages 342-353, June.
    17. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    18. L. S. Lasdon & R. C. Terjung, 1971. "An Efficient Algorithm for Multi-Item Scheduling," Operations Research, INFORMS, vol. 19(4), pages 946-969, August.
    19. Haase, Knut & Kimms, Alf, 2000. "Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities," International Journal of Production Economics, Elsevier, vol. 66(2), pages 159-169, June.
    20. Gaetan Belvaux & Laurence A. Wolsey, 2001. "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs," Management Science, INFORMS, vol. 47(7), pages 993-1007, July.
    21. Chen, Haoxun, 2015. "Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems," Omega, Elsevier, vol. 56(C), pages 25-36.
    22. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, February.
    23. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    24. VANDERBECK, François & WOLSEY, Laurence A., 1992. "Valid inequalities for the Lasdon-Terjung production model," LIDAM Reprints CORE 1004, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    25. 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.
    26. 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.
    27. 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.
    28. MILLER, Andrew J. & WOLSEY, Laurence A., 2003. "Tight MIP formulations for multi-item discrete lot-sizing problems," LIDAM Reprints CORE 1639, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    2. 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.
    3. Xiongping Yue & Dong Mu & Chao Wang & Huanyu Ren & Jianbang Du & Pezhman Ghadimi, 2024. "Disruption risks to Chinese overseas flat panel display supply networks under China’s zero-COVID policy," Operations Management Research, Springer, vol. 17(2), pages 406-437, June.
    4. 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.
    5. R. Micale & C. M. La Fata & M. Enea & G. La Scalia, 2021. "Regenerative scheduling problem in engineer to order manufacturing: an economic assessment," Journal of Intelligent Manufacturing, Springer, vol. 32(7), pages 1913-1925, October.

    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. 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.
    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. 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.
    4. Francesco Gaglioppa & Lisa A. Miller & Saif Benjaafar, 2008. "Multitask and Multistage Production Planning and Scheduling for Process Industries," Operations Research, INFORMS, vol. 56(4), pages 1010-1025, August.
    5. 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.
    6. Tiacci, Lorenzo & Saetta, Stefano, 2012. "Demand forecasting, lot sizing and scheduling on a rolling horizon basis," International Journal of Production Economics, Elsevier, vol. 140(2), pages 803-814.
    7. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    8. Kaczmarczyk, Waldemar, 2020. "Valid inequalities for proportional lot-sizing and scheduling problem with fictitious microperiods," International Journal of Production Economics, Elsevier, vol. 219(C), pages 236-247.
    9. 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.
    10. Wei, Wenchao & Guimarães, Luis & Amorim, Pedro & Almada-Lobo, Bernardo, 2017. "Tactical production and distribution planning with dependency issues on the production process," Omega, Elsevier, vol. 67(C), pages 99-114.
    11. Andrea Raiconi & Julia Pahl & Monica Gentili & Stefan Voß & Raffaele Cerulli, 2017. "Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-24, October.
    12. Kovcs, Andrs & Brown, Kenneth N. & Tarim, S. Armagan, 2009. "An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups," International Journal of Production Economics, Elsevier, vol. 118(1), pages 282-291, March.
    13. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    14. Raf Jans, 2009. "Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 123-136, February.
    15. Guimarães, Luis & Klabjan, Diego & Almada-Lobo, Bernardo, 2013. "Pricing, relaxing and fixing under lot sizing and scheduling," European Journal of Operational Research, Elsevier, vol. 230(2), pages 399-411.
    16. 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.
    17. 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.
    18. Jans, R.F., 2006. "Solving Lotsizing Problems on Parallel Identical Machines Using Symmetry Breaking Constraints," ERIM Report Series Research in Management ERS-2006-051-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.
    19. Almeder, Christian & Klabjan, Diego & Traxler, Renate & Almada-Lobo, Bernardo, 2015. "Lead time considerations for the multi-level capacitated lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 727-738.
    20. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.

    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:93:y:2020:i:c:s0305048318311873. 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.