A capacitated multi-stage lot-sizing problem for general product structures with setup and lead times is considered. The problem is formulated as a mixed integer linear program and valid inequalities that are high dimension faces of the problem's convex hull are identified. A fast separation algorithm is developed to iteratively select those inequalities that cut off the solution of the linear programming relaxation. The resulting much improved lower bounds are used in a Branch-and-Bound algorithm. Computational test results are presented. © 1995.227669680Bahl, Ritzman, Gupta, Determining lot-sizes and resource requirements a review (1987) Operations Research, 35, pp. 237-249Johnson, Montgomey, (1974) Operations Research in Production Plann...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
We consider an uncapacitated lot sizing problem in co-production systems, in which it is possible to...
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
The dynamic economic lot sizing model, which lies at the core of numerous production planning applic...
International audienceWe address a multi-item capacitated lot-sizing problem with setup times and sh...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
International audienceWe consider a problem arising in the context of industrial production planning...
International audienceWe consider a problem arising in the context of industrial production planning...
Various mixed-integer programming models have been proposed for solving the capacitated multi-level ...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
We consider an uncapacitated lot sizing problem in co-production systems, in which it is possible to...
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
The dynamic economic lot sizing model, which lies at the core of numerous production planning applic...
International audienceWe address a multi-item capacitated lot-sizing problem with setup times and sh...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
International audienceWe consider a problem arising in the context of industrial production planning...
International audienceWe consider a problem arising in the context of industrial production planning...
Various mixed-integer programming models have been proposed for solving the capacitated multi-level ...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
Best application paper awardInternational audienceWe consider a problem arising in the context of i...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
We consider an uncapacitated lot sizing problem in co-production systems, in which it is possible to...