An efficient heuristic for medium-term planning in shampoo production

A review of discrete-time optimization models for tactical production planning

“…Furthermore, the combination of production capacity constraints with inventory constraints, and production capacity constraints with inventory constraints and supply constraints, are the other most common combinations, with 19 and 10 references, respectively. A group of 7 references (Gutierrez et al, 2008;Li et al, 2009a;Liu and Tu, 2008a;Liu et al, 2007;Mocquillon et al, 2011;Naeem et al, 2013;Pal et al, 2011) presents inventory constraints in isolation, while another group of 6 references (Akbalik and Penz, 2011;Baptiste et al, 2008;Rizk et al, 2008Rizk et al, , 2006aWu et al, 2010;Zhang et al, 2011) addresses the production planning problem by taking into account the production and transport resources constraints. Boudia et al (2008), Jung et al (2008), Almeder et al (2009), Bard and Nananukul (2009) and Armentano et al (2011) consider inventory, productive and transport resources constraints simultaneously, while a group of 5 references (Demirli and Yimer, 2008;Feng et al, 2010Feng et al, , 2008Gunnarsson and Ronnqvist, 2008;Peidro et al, 2010) adds supply constraints to the latter combination.…”

“…Finally, specific solution methods, such as constructive heuristics or tailored algorithms, hierarchical solution methods or simulation frameworks, are proposed in 56 references, while greedy heuristics is considered in 4 of the reviewed works (Bollapragada et al, 2011;Boudia et al, 2008;Ferguson et al, 2009;Mocquillon et al, 2011). Other solution methods, such as dynamic programming-based algorithms, are presented in 34 of the analyzed papers.…”