Skip to main content
Log in

A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, a multiproduct multiperiod capacitated production system that has been organized as a flow shop is considered. The main novelty of the paper is proposing a more efficient mathematical model for the problem of integrating lot sizing and scheduling with sequence-dependent setups. In comparison to the former model, because of fewer continuous and binary decision variables and constraints in the proposed model, this model is very easier to solve. Comparison between two models proves the superiority of the proposed model. Two mixed integer programming-based approaches with rolling horizon framework have been used to solve this model. To evaluate the performance of the proposed model and solution method, problems of different scales have been studied. The used algorithms search the solution space for both lot-sizing and scheduling problems and find a combination of production planning and scheduling that is feasible and close to optimum.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Yan H-S, Xia Q-F, Zhu M-R, Liu X-L, Guo Z-M (2003) Integrated production planning and scheduling on automobile assembly lines. IIE Trans 35(8):711–725

    Article  Google Scholar 

  2. Lee I, Sikora R, Shaw MJ (1999) A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes. IEEE Trans Syst Man Cybern B Cybern 27(1):36–54

    Article  Google Scholar 

  3. Stadtler H, Kilger C (2008) Supply chain management and advanced planning: concepts, models software and case studies, 4th edn. Springer, Berlin

    Book  Google Scholar 

  4. Maravelias CT, Sung C (2009) Integration of production planning and scheduling: overview, challenges and opportunities. Comput Chem Eng 33:1919–1930

    Article  Google Scholar 

  5. Lasserre JB (1992) An integrated model for job-shop planning and scheduling. Manag Sci 38(8):1201–1211

    Article  MATH  Google Scholar 

  6. Dauzère-Péres S, Lasserre JB (1994) Integration of lotsizing and scheduling decisions in a job-shop. Eur J Oper Res 75:413–426

    Article  MATH  Google Scholar 

  7. Anwar MF, Nagi R (1997) Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups. Int J Prod Res 35:1447–1470

    Article  MATH  Google Scholar 

  8. Sikora R, Chhajed D, Shaw MJ (1996) Integrating lot-sizing and sequencing decisions for scheduling a capacitated flow line. Compt Indust Eng 30(4):659–679

    Article  Google Scholar 

  9. Ponnambalam SG, Mohan Reddy M (2003) A GA-SA multiobjective hybrid search algorithm for integrating lot sizing and sequencing in flow-line scheduling. Int J Adv Manuf Technol 21:126–137

    Google Scholar 

  10. Buschkühl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectr 32:231–261

    Article  MATH  Google Scholar 

  11. Drexl A, Kimms A (1997) Lot sizing and scheduling, survey and extensions. Eur J Oper Res 9(2):221–235

    Article  Google Scholar 

  12. Karimi B, Fatemi Ghomi SMT, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31(5):365–378

    Article  Google Scholar 

  13. Wagner HM, Whithin TM (1958) Dynamic version of the economic lot size model. Manag Sci 5:89–96

    Article  MATH  Google Scholar 

  14. Fleischmann B, Meyr H (1997) The general lotsizing and scheduling problem. OR Spectr 19(1):11–21

    Article  MathSciNet  MATH  Google Scholar 

  15. Clark AR, Clark SJ (2000) Rolling-horizon lot-sizing when setup times are sequence-dependent. Int J Prod Res 38(10):2287–2308

    Article  MATH  Google Scholar 

  16. Haase K, Kimms A (2000) Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. Int J Prod Econ 66:159–169

    Article  Google Scholar 

  17. Gupta D, Magnusson T (2005) The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Comput Oper Res 32:727–747

    Article  MathSciNet  MATH  Google Scholar 

  18. Almada-Lobo B, Klabjan D, Carravilla MA, Oliveira J (2007) Single machine multiproduct capacitated lotsizing with sequence-dependent setups. Int J Prod Res 45(20):4873–4894

    Article  MATH  Google Scholar 

  19. Kimms A (1996) Multi-level, single-machine lotsizing and scheduling (with initial inventory). Eur J Oper Res 89(1):86–99

    Article  MathSciNet  MATH  Google Scholar 

  20. Kimms A, Drexl A (1998) Some insights into proportional lotsizing and scheduling. J Oper Res 49(11):1196–1205

    MATH  Google Scholar 

  21. Fandel G, Stammen-Hegene C (2006) Simultaneous lot sizing and scheduling for multi-product multi-level production. Int J Prod Econ 104(2):308–316

    Article  Google Scholar 

  22. Mohammadi M, Fatemi Ghomi SMT, Karimi B, Torabi SA (2010) Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups. J Intell Manuf 21:501–510

    Article  Google Scholar 

  23. Mohammadi M (2010) Integrating lotsizing, loading, and scheduling decisions in flexible flow shops. Int J Adv Manuf Technol 50:1165–1174

    Article  Google Scholar 

  24. Mohammadi M, Karimi B, Fatemi Ghomi SMT, Torabi SA (2010) A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequence-dependent setups. Int J Adv Manuf Technol 49:201–211

    Article  Google Scholar 

  25. Merece C, Fonton G (2003) MIP-based heuristics for capacitated lotsizing problems. Int J Prod Econ 85(1):97–111

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Reza Ramezanian.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ramezanian, R., Saidi-Mehrabad, M. & Teimoury, E. A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments. Int J Adv Manuf Technol 66, 347–361 (2013). https://doi.org/10.1007/s00170-012-4329-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4329-3

Keywords

Navigation