Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations

In this work, we face a variant of the capacitated lot sizing problem. This is a classical problem addressing the issue of aggregating lot sizes for a finite number of discrete periodic demands that need to be satisfied, thus setting up production resources and eventually creating inventories, while minimizing the overall cost. In the proposed variant we take into account lifetime constraints, which model products with maximum fixed shelflives due to several possible reasons, including regulations or technical obsolescence. We propose four formulations, derived from the literature on the classical version of the problem and adapted to the proposed variant. An extensive experimental phase on two datasets from the literature is used to test and compare the performance of the proposed formulations.

[1]  Laurence A. Wolsey,et al.  bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems , 2000 .

[2]  Stefan Voß,et al.  Dynamic lot-sizing with rework of defective items and minimum lot-size constraints , 2016 .

[3]  Stefan Voß,et al.  Integrating deterioration and lifetime constraints in production and supply chain planning: A survey , 2014, Eur. J. Oper. Res..

[4]  Herbert Meyr,et al.  Simultaneous lotsizing and scheduling by combining local search with dual reoptimization , 2000, Eur. J. Oper. Res..

[5]  Arianna Alfieri,et al.  LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm , 2002 .

[6]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

[7]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[8]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[9]  V. Hsu Dynamic Economic Lot Size Model with Perishable Inventory , 2000 .

[10]  Stefan Voß,et al.  Load dependent lead times and sustainability , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[11]  Knut Haase,et al.  Capacitated lot-sizing with sequence dependent setup costs , 1996 .

[12]  Hartmut Stadtler,et al.  Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing , 1996 .

[13]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[14]  Laurence A. Wolsey,et al.  Lot-size models with backlogging: Strong reformulations and cutting planes , 1988, Math. Program..

[15]  Stefan Voß,et al.  Discrete Lot-Sizing and Scheduling Including Deterioration and Perishability Constraints , 2010, Heinz Nixdorf Symposium.

[16]  John O. McClain,et al.  Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction , 1983 .

[17]  Zikuan Liu,et al.  Manufacturing systems with random breakdowns and deteriorating items , 2001, Autom..

[18]  Diwakar Gupta,et al.  The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times , 2005, Comput. Oper. Res..

[19]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

[20]  Upendra Dave A probabilistic scheduling period inventory model for deteriorating items with lead time , 1986, Z. Oper. Research.

[21]  Hoesel van Cpm,et al.  A linear description of the discrete lot-sizing and scheduling problem , 1994 .

[22]  Shahin Rahimifard,et al.  A responsive demand management framework for the minimization of waste in convenience food manufacture , 2006, Int. J. Comput. Integr. Manuf..

[23]  Knut Haase,et al.  Ein modellgestützter Ansatz zur mittelfristigen Produktions- und Ablaufplanung für eine Brauerei , 2006 .

[24]  Laurence A. Wolsey,et al.  Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs , 2001, Manag. Sci..

[25]  Stefan Voß,et al.  A MIP-based framework and its application on a lot sizing problem with setup carryover , 2013, J. Heuristics.

[26]  E. Silver,et al.  A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .

[27]  Bert De Reyck,et al.  Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times , 2015, INFORMS J. Comput..

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

[29]  Julia Pahl Production Planning with Load Dependent Lead Times and Sustainability Aspects , 2012 .

[30]  Carlos Henggeler Antunes,et al.  Multi-Objective Lot-Sizing and Scheduling Dealing with Perishability Issues , 2011 .

[31]  Hui-Ming Wee,et al.  Economic production lot size model for deteriorating items with partial back-ordering , 1993 .

[32]  Alistair R. Clark,et al.  Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups , 2007, J. Heuristics.

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

[34]  M. Lütke entrup,et al.  Mixed-Integer Linear Programming approaches to shelf-life-integrated planning and scheduling in yoghurt production , 2005 .