“…One of the main reasons for the success of these metaheuristics is their flexibility and ability to handle large and complex problems. As a consequence, these methods are usually developed for extensions of the standard lot sizing problems for which no good special purpose algorithm exists and which are too difficult to solve with commercial integer optimization software: 1) Single level CLSP (Hindi 1996, Kohlmorgen et al 1999, with set up times (Hung et al 1999, Özdamar andBozyel 2000), with set up times and overtime (Özdamar, Birbil and Portmann 2002), with set up times and multiple resources (Hung et al 2003), with set up carry over (Gopalakrishnan et al 2001), with sequence dependencies (Fleischmann and Meyr 1997, Laguna 1999, Meyr 2000, on parallel machines (Özdamar and Birbil 1998), ; 2) Multi level lot sizing without capacities (Kuik and Salomon 1990, Dellaert and Jeunet 2000, Dellaert et al 2000, Tang 2004);…”