Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems

In this paper a new heuristic is proposed to solve general multi-level lot-sizing and scheduling problems. The idea is to cross-fertilize the principles of the meta-heuristic Variable Neighborhood Decomposition Search (VNDS) with those of the MIP-based Fix&Optimize heuristic. This combination will make it possible to solve the kind of problems that typically arise in the consumer goods industry due to sequence-dependent setups and shifting bottlenecks. In order to demonstrate the strength of this procedure, a GLSP variant for multiple production stages is chosen as a representative. With the help of artificial and real-world instances, the quality of the solution as well as the computational performance of the new procedure is tested and compared to a standard MIP-solver.

[1]  Nenad Mladenovic,et al.  Variable neighbourhood decomposition search for 0-1 mixed integer programs , 2009, Comput. Oper. Res..

[2]  Herbert Meyr,et al.  Simultaneous lotsizing and scheduling on parallel machines , 2002, Eur. J. Oper. Res..

[3]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[4]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering) , 2006 .

[5]  Mirjana Cangalovic,et al.  General variable neighborhood search for the continuous optimization , 2006, Eur. J. Oper. Res..

[6]  Stefan Helber,et al.  A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems , 2010 .

[7]  Ross J. W. James,et al.  Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics , 2011, Comput. Oper. Res..

[8]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[9]  B. Fleischmann.  The discrete lot-sizing and scheduling problem with sequence-dependent setup costs , 1994 .

[10]  Maria Antónia Carravilla,et al.  Production planning and scheduling in the glass container industry: A VNS approach , 2008 .

[11]  Wilbert E. Wilhelm,et al.  Scheduling and lot sizing with sequence-dependent setup: A literature review , 2006 .

[12]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[13]  Hartmut Stadtler,et al.  Multi-level single machine lot-sizing and scheduling with zero lead times , 2011, Eur. J. Oper. Res..

[14]  Zeger Degraeve,et al.  Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches , 2004, Eur. J. Oper. Res..

[15]  Herbert Meyr.  Simultane Losgrößen- und Reihenfolgeplanung bei mehrstufiger kontinuierlicher Fertigung , 2004 .

[16]  Celso C. Ribeiro,et al.  Variable neighborhood search for the degree-constrained minimum spanning tree problem , 2002, Discret. Appl. Math..

[17]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[18]  Gregorio Tirado,et al.  The double traveling salesman problem with multiple stacks: A variable neighborhood search approach , 2009, Comput. Oper. Res..

[19]  Bernardo Almada-Lobo,et al.  Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups , 2010 .

[20]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[21]  Horst Tempelmeier,et al.  Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic , 2009, Comput. Oper. Res..

[22]  Florian Sahling.  Mehrstufige Losgrößenplanung bei Kapazitätsrestriktionen , 2010 .

[23]  Matthias Prandtstetter,et al.  An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem , 2008, Eur. J. Oper. Res..

[24]  Bernardo Almada-Lobo,et al.  Lot sizing and scheduling: industrial extensions and research opportunities , 2011 .

[25]  Herbert Meyr,et al.  Multi-stage simultaneous lot-sizing and scheduling for flow line production , 2013, OR Spectr..

[26]  Herbert Meyr,et al.  The general lotsizing and scheduling problem , 1997 .

[27]  Paolo Toth,et al.  The VIII Metaheuristics International Conference id-1 Variable Neighborhood Search for the Cost Constrained Minimum Label Spanning Tree and Label Constrained Minimum Spanning Tree Problems , 2009 .

[28]  Horst Tempelmeier,et al.  Dynamic capacitated lot-sizing problems: a classification and review of solution approaches , 2010, OR Spectr..