Valid inequalities and facets for the capacitated lot-sizing problem with changeover costs

dc.contributor.author	Sastry, S. Trilochan
dc.date.accessioned	2010-03-29T09:17:24Z
dc.date.available	2010-03-29T09:17:24Z
dc.date.copyright	1991-11
dc.date.issued	2010-03-29T09:17:24Z
dc.identifier.uri	http://hdl.handle.net/11718/1794
dc.description.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.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;1991/987
dc.subject	lot-sizing problem
dc.title	Valid inequalities and facets for the capacitated lot-sizing problem with changeover costs	en
dc.type	Working Paper	en