On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

We consider the single??item discrete lot??sizing and scheduling problem.?? We present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence of Wagner-??Whitin costs??

Polyhedral characterization of the economic lot-sizing problem with start-up costs

A class of strong valid inequalities is described for the single-item uncapacitated economic lot-sizing problem with start-up costs. It is shown that these inequalities yield a complete polyhedral characterization of the problem. The corresponding separation problem is formulated as a shortest path problem. Finally, a reformulation as a plant location problem is shown to imply the class of strong valid inequalities, which shows that this reformulation is tight also

Produktieplanning in praktijk en theorie

Produktieplanningsproblemen zijn vaak lastiger dan ze er op het eerste gezicht uitzien. Ze vormen daarmee een bron van irritatie voor beslissers en van inspiratie voor besliskundigen. Waartoe dit laatste kan leiden willen wij in deze bijdrage illustreren met twee voorbeelden

A decade of combinatorial optimization

This paper offers a brief overview of the developments in combinatorial optimization during the past decade. We discuss improvements in polynomial-time algorithms for problems on graphs and networks, and review the methodological and computational progress in linear and integer optimization. Some of the more prominent software packages in these areas are mentioned. With respect to obtaining approximate solutions to NP-hard problems, we survey recent positive and negative results on polynomial-time approximability and summarize the advances in local search