A capacitated lot sizing problem with stochastic setup times and overtime

In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times and Overtime (CLSPSSTO). We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SSTO is formulated as a two-stage stochastic programming problem. A procedure is proposed to exactly compute the expected overtime for a given setup and production plan when the setup times follow a Gamma distribution. A sample average approximation procedure is applied to obtain upper bounds and a statistical lower bound. This is then used to benchmark the performance of two additional heuristics. A first heuristic is based on changing the capacity in the deterministic counterpart, while the second heuristic artificially modifies the setup time. We conduct our computational experiments on well-known problem instances and provide comprehensive analyses to evaluate the performance of each heuristic. (C) 2018 Elsevier B.V. All rights reserved.