Browsing Working Papers by Subject "lot-sizing problem"
Now showing items 1-1 of 1
-
Valid inequalities and facets for the capacitated lot-sizing problem with changeover costs
(2010-03-29)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 ...