USING A CLEARING FUNCTION APPROACH WITH DECOMPOSITION FOR PRODUCTION PLANNING PROBLEMS

The idea of using Clearing Functions (CF) to represent the nonlinear dependence between workload and lead time in deterministic Linear Programming (LP) models for production planning, results in an increase in the size of the models to be ssolved. In this paper we address this problem by means of a decomposition approach similar to that of Sampaio et alli (2009), wich has proven to be quite efficient for classical LP models for production planning, wich we extend to take into account the piecewise linear approximation of the CF function.