Add to ORKGA class of strong valid inequalities for the discrete lot-sizing and scheduling problem is presented. Necessary and sufficient conditions are derived for valid inequalities in this class to be facet-defining. The separation problem for these inequalities is shown to be solvable in polynomial time by dynamic programming
International audienceThe present work is intended as a first step towards applying semidefinite pro...
We consider the classical lot-sizing problem with constant production capacities (LCC) and a variant...
Here we study the discrete lot-sizing problem with an initial stock variable and an associated varia...
A new integer linear programming formulation for the discrete lot-sizing and scheduling problem is 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 plannin...
International audienceWe consider a production planning problem known as the discrete lot-sizing and...
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
International audienceWe consider a problem arising in the context of industrial production planning...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
A class of strong valid inequalities is described for the single-item uncapacitated economic lot-siz...
A class of strong valid inequalities is described for the single-item uncapacitated economic lot-siz...
© 2021 Elsevier B.V.In this paper, we propose new integer optimization models for the lot-sizing and...
International audienceThe present work is intended as a first step towards applying semidefinite pro...
We consider the classical lot-sizing problem with constant production capacities (LCC) and a variant...
Here we study the discrete lot-sizing problem with an initial stock variable and an associated varia...
A new integer linear programming formulation for the discrete lot-sizing and scheduling problem is 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 plannin...
International audienceWe consider a production planning problem known as the discrete lot-sizing and...
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
International audienceWe consider a problem arising in the context of industrial production planning...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
A class of strong valid inequalities is described for the single-item uncapacitated economic lot-siz...
A class of strong valid inequalities is described for the single-item uncapacitated economic lot-siz...
© 2021 Elsevier B.V.In this paper, we propose new integer optimization models for the lot-sizing and...
International audienceThe present work is intended as a first step towards applying semidefinite pro...
We consider the classical lot-sizing problem with constant production capacities (LCC) and a variant...
Here we study the discrete lot-sizing problem with an initial stock variable and an associated varia...