Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/1794
Title: Valid inequalities and facets for the capacitated lot-sizing problem with changeover costs
Authors: Sastry, S. Trilochan
Keywords: lot-sizing problem
Issue Date: 29-Mar-2010
Series/Report no.: WP;1991/987
Abstract: We study a scheduling problem with changeover costs and capacity constraints. The problem is NP-complete and combinatorial algorithms have not been very successful. We identify a general class of facets which subsumes as a special case all facets described earlier. We also develop a cutting plane based procedure for the dynamic version of the problem, and solve problem instances with up to 1200 integer variables to optimality without resorting to branch and bound procedures.
URI: http://hdl.handle.net/11718/1794
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 1991_987.pdf1.89 MBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.