Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The aim of lot sizing problems is to determine the periods where production takes place and the quantities to be produced in order to satisfy the customer demand while minimizing the total cost. Due to its importance on the efficiency of the production and inventory systems, lot sizing problems are one of the most challenging production planning problems and have been studied for many years with different modelling features. Among these problems, the capacitated lot sizing problem (CLSP) has received a lot of attention from researchers. Having motivated from our earlier study, this study proposes a new hybrid approach for solving the CLSP with the extension of setup carryover. Moreover, the initialization scheme proposed in the earlier study has also been investigated comprehensively. Lastly, an experimental study evaluating the solution quality of the proposed approach is carried out using various problem instances and promising results are obtained when compared to the recent results in the literature.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Gören Güner H, Tunali S, Jans R (2012) A hybrid approach for the capacitated lot sizing problem with setup carryover. Int J of Produc Res 50(6):1582–1597

    Article  Google Scholar 

  2. Florian M, Lenstra JK, Rinnooy Kan AHG (1980) Deterministic production planning: Algorithms and complexity. Manag Sci 26:669–679

    Article  MATH  MathSciNet  Google Scholar 

  3. Trigeiro W, Thomas LJ, McClain JO (1989) Capacitated Lot Sizing with setup times. Manag Sci 35:353–366

    Article  Google Scholar 

  4. Dillenberger C, Escudero LF, Wollensak A, Zhang W (1993) Operations research in production planning and control. In: Fandel G , Gulledge T, Jones A (eds) On solving a large-scale resource allocation problem in production planning. Springer, Heidelberg, pp 105–119

    Google Scholar 

  5. Sox CR, Gao Y (1999) The capacitated lot-sizing problem with set-up carryover. IIE IIE Transac 31:173–181

    Google Scholar 

  6. Suerie C, Stadtler H (2003) The capacitated lot-sizing problem with linked lot sizes. Manag Sci 49(8):1039–1054

    Article  MATH  Google Scholar 

  7. Sahling F, Buschkühl L, Tempelmeier H, Helber S (2009) Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Computer and Op Res 36(9):2546–2553

    Article  MATH  Google Scholar 

  8. Helber S, Sahling F (2010) A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int J of Prod Econ 123:247–256

    Article  Google Scholar 

  9. Lang JC, Shen Z-JM (2011) Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions. European J of Oper Res 3:214

    Google Scholar 

  10. Xiao J, Zhang C, Zheng L, Gupta JND (2013) MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem. Int J of Produc Res 51(16):5011–5028

    Article  Google Scholar 

  11. Gopalakrishnan M, Ding K, Bourjolly J-M, Mohan S. (2001) A Tabu search heuristic for the capacitated lot-sizing problem with set-up carryover. Manag Sci 47(6):851–863

    Article  MATH  Google Scholar 

  12. Karimi B, Ghomi FSMT, Wilson JM (2006) A tabu search heuristic for the CLSP with backlogging and set-up carryover. J of the Opl Res Soc 2006 57:140–157

    MATH  Google Scholar 

  13. Nascimento MC, Toledo FMB (2008) A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over. J of the Braz Computer Soc 14(4):7–15

    Article  Google Scholar 

  14. Haase K (1994) Lot sizing and scheduling for Production Planning. In: Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, p 408

  15. Haase K (1998) Capacitated lot-sizing with linked production quantities of adjacent periods. In: Drexl A, Kimms A (eds) Beyond Manufacturing Resource Planning (MRP II). Advanced Models and Methods for Production Planning. Springer, Berlin, pp 127–146

    Chapter  Google Scholar 

  16. Karimi B, Ghomi F (2002) A new heuristic for the CLSP problem with backlogging and set-up carryover. Int J of Adv Manuf Syst 5(2):66–77

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Seanner F, Almada-Lobo B, Meyr H (2013) Combining the principles of variable neighborhood decomposition and the fix-and-optimize heuristic to solve the multi-level lot-sizing and scheduling problems. Comp Op Res 40:303–317

    Article  Google Scholar 

  19. Gen M, Cheng R (1997) Genetic Algorithms and Engineering Design. John Wiley and Sons, New York

    Google Scholar 

  20. Kang MH, Choi HR, Kim HS, Park BJ (2012) Development of a maritime transportation planning support system for car carriers based on genetic algorithm. Appl Intell 36(3):585–604

    Article  Google Scholar 

  21. Ombuki B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24(1):17–30

    Article  Google Scholar 

  22. Korkmaz EE (2010) Multi-objective genetic algorithms for grouping problems. Appl Intell 33(2):179–192

    Article  Google Scholar 

  23. Mohammadi M, Ghomi FSMT (2011) Genetic algorithm-based heuristic for capacitated lot sizing problem in flow shops with sequence-dependent setups. Expert Syst Appl 38(6):7201–7207

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Kinikli Campus, Pamukkale University, 20070, Denizli, Turkey

    Hacer Güner Gören

  2. Department of Business Administration, Izmir University of Economics, Sakarya Caddesi, No: 156, 35330, Balcova-Izmir, Turkey

    Semra Tunalı

Authors
  1. Hacer Güner Gören
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Semra Tunalı
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hacer Güner Gören.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gören, H.G., Tunalı, S. Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach. Appl Intell 42, 805–816 (2015). https://doi.org/10.1007/s10489-014-0626-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-014-0626-x

Keywords

Search

Navigation