A New Formulation for a Variant of the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setup Costs and Times: Single Machine, Multiple Products and Periods
Management and Control of Production and Logistics, Volume # | Part#
Chaieb Memmi, Imen; Hammami Laaroussi, Sondes
Digital Object Identifier (DOI)
Supply Chain Integration and Management Issues; Production Control, Control Systems; Manufacturing Production
We present in this paper a new formulation of the Capacitated Lot sizing and Scheduling Problem with Sequence Dependent set up cost and times (CLSPSD) problem, well known as an NP-Hard problem. We formulate the problem as a non linear model and use it to modify a lot sizing problem described in literature and applied to a real-life problem of a Canadian paper maker where the paper machine represents the bottleneck resource and consequently requires an efficient production planning approach optimizing resource utilization and minimizing production, setup and inventory costs. In these previous works, the dependency of the costs and times with the production sequences isnÂ’t thoroughly dealt with. We prove that by really treating the problem of determining the production sequences, we handle to considerably reduce the supply chain total cost. This cost includes production costs, inventory holding costs, start up and setup costs. The reduction in the total cost varies from 6 to 52% when setup costs vary from 20% to 200% of inventory holding costs.
A new formulation for a variant of the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent setup costs and times: Single machine, multiple products and periods I. Chaieb Memmi*, S. Hammami* * ESTI, 45 Rue des Entrepreneurs, Charguia II, 2035 Tunis Carthage, Tunisia (Tel: 216-71-941-579; e-mail: email@example.com, firstname.lastname@example.org ) Bouchriha, H., M. Ouhimmou and S. D’Amours (2007). Lot sizing problem on a paper machine under a cyclic production approach. International Journal of Production Economics, 105, 318-328. Gupta, D. and T. Magnusson (2005). The capacitated lot sizing and scheduling problem with sequence dependent setup costs and setup times. Computers & Operations Research, 32, 727-747. Haase K. and A. Kimms (2000). Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics, 66, 159-169. Jans, R. and Z. Degraeve (2007). Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. European Journal of Operational Research, 177, 1855-1875. Kovács, A., K.N. Browna and A. Tarim (2009). An efficient MIP model for the capacitated lot sizing and scheduling problem with sequence dependent setups. International Journal of Production Economics, 118, 282-291. Salomon, M., M.M. Salomon, L.N. Van Wassenhove, Y.D. Dumas and S. Dauzere-Peres (1997). Solving the discrete lot sizing and scheduling with sequence dependent setup costs and setup times using the Travelling Salesman Problem with time windows. European Journal of Operational Research, 100, 494-513.