“…Mathematical programming heuristics, Lagrangian relaxation heuristics, decomposition and aggregation heuristics, meta heuristics, problem-specific greedy heuristics, piecewise linear approximation methods are used to solve different lot sizing problems. Some works adopting those methods can be found in González-Ramírez et al (2011), Absi et al (2013), Toledo et al (2015), Rossi et al (2015), Molina et al (2016). Comprehensive reviews on lot sizing problem could be addressed in Maes and Van Wassenhove (1988), Karimi et al (2003), Brahimi et al (2006), Jans and Degraeve (2007), Buschkühl et al (2010), Brahimi et al (2017).…”