A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand

We investigate a parallel machine multi-item lot-sizing and scheduling problem with a secondary resource, in which demands are given for the entire planning horizon rather than for every single period. All-or-nothing assumption of the discrete lot-sizing and scheduling problem is valid so that a machine is either idle or works at full capacity in a period. The objective is to minimise the number of setups and teardowns. We prove that the problem is NP-hard and present two equivalent formulations. We show some properties of the optimal objective value, give optimality conditions and suggest a heuristic algorithm. We discuss and formulate two possible extensions related to real-life applications. Finally, we carry out computational experiments to compare the two formulations, to determine the effect of our proposed modeling improvements on solution performance, and to test the quality of our heuristic.

[1]  Silvio A. de Araujo,et al.  Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines , 2014, Ann. Oper. Res..

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

[3]  Laurence A. Wolsey,et al.  Valid Inequalities for the Lasdon-Terjung Production Model , 1992 .

[4]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[5]  Daniel Quadt,et al.  Lot-Sizing and Scheduling for Flexible Flow Lines , 2004 .

[6]  Stan P. M. van Hoesel,et al.  On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs , 1997, Oper. Res. Lett..

[7]  Daniel Quadt,et al.  Capacitated lot‐sizing and scheduling with parallel machines, back‐orders, and setup carry‐over , 2009 .

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

[9]  JansRaf.  Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints , 2009 .

[10]  Florian Seeanner.  Multi-level lot-sizing and scheduling , 2013 .

[11]  Florian Seeanner.  Multi-Stage Simultaneous Lot-Sizing and Scheduling , 2013 .

[12]  Laurence A. Wolsey,et al.  On discrete lot-sizing and scheduling on identical parallel machines , 2012, Optim. Lett..

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

[14]  Raf Jans,et al.  An industrial extension of the discrete lot-sizing and scheduling problem , 2004 .

[15]  Carsten Jordan,et al.  Batching and Scheduling , 1996 .

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

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

[18]  Heinrich Kuhn,et al.  A taxonomy of flexible flow line scheduling procedures , 2007, Eur. J. Oper. Res..

[19]  Fabrizio Marinelli,et al.  Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company , 2007, Ann. Oper. Res..

[20]  Zeger Degraeve,et al.  Modeling industrial lot sizing problems: a review , 2008 .

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

[22]  Yves Dallery,et al.  Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources , 2011 .

[23]  Alf Kimms.  Multi-Level Lot Sizing and Scheduling , 1997 .

[24]  Waldemar Kaczmarczyk.  Proportional lot-sizing and scheduling problem with identical parallel machines , 2011 .

[25]  C. Suerie.  Time Continuity in Discrete Time Models , 2005 .

[26]  Horst Tempelmeier,et al.  Simultaneous lotsizing and scheduling problems: a classification and review of models , 2017, OR Spectr..

[27]  Hanif D. Sherali,et al.  Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..