A FRAMEWORK FOR MODELING SETUP CARRYOVER IN THE CAPACITATED LOT-SIZING PROBLEM

This paper addresses the single-level capacitated lot sizing problem ( CLSP) with setup carryover. Specifically, we consider a class of produ ction planning problems in which multiple products can be produced wit hin a time period and significant setup times are incurred when changi ng from one product to another. Hence, there might be instances where developing a feasible schedule becomes possible only if setups are car ried over from one period to another. We develop a modelling framework to formulate the CLSP with setup times and setup carryovers. We then extend the modelling framework to include multiple machines and tool r equirements planning. The need for such a model that integrates both p lanning and lot sizing decisions is motivated by the existence of a si milar problem in a paper mill. We apply the modelling framework to sol ve optimally, an instance of the paper mill's problem.