A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting

The capacitated lot-sizing problem with set-up carryover and set-up splitting (CLSP-SCSS) is formulated as a mixed integer linear program. We define set-up carryover as the production of a product that is continued over from one period to another without incurring an extra set-up. Set-up splitting occurs when the set-up for a product is started at the end of a period and completed at the beginning of the next period. We allow product dependent set-ups. Initial experimentation highlights the importance of including set-up splitting in the CLSP model. In 12 out of the 18 problem instances tested, our model yielded better solutions or removed infeasibility when compared with a CLSP model without set-up splitting.

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

[2]  Wu Zhang,et al.  On practical resource allocation for production planning and scheduling with period overlapping setups , 1994 .

[3]  David M. Miller,et al.  A framework for modelling setup carryover in the capacitated lot sizing problem , 1995 .

[4]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[5]  F. Toledo,et al.  A network flow model for the capacitated lot-sizing problem , 1999 .

[6]  C. R. Sox,et al.  The capacitated lot sizing problem with setup carry-over , 1999 .

[7]  Mohan Gopalakrishnan,et al.  A modified framework for modelling set-up carryover in the capacitated lotsizing problem , 2000 .

[8]  Hartmut Stadtler,et al.  The Capacitated Lot-Sizing Problem with Linked Lot Sizes , 2003, Manag. Sci..

[9]  Markku Kuula,et al.  Multiperiod production planning carrying over set-up time , 2003 .

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

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

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

[13]  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..

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