For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q, SQ ) inequalities can be simplified and extended. Finally some limited computational results are presented
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
Given rational numbers C_0,...,C_m and b_0,...,b_m, the mixing set with arbitrary capacities is the ...
International audienceWe study the uncapacitated lot-sizing problem with uncertain demand and costs....
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a sc...
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated l...
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated l...
This paper addresses a particular stochastic lot-sizing and scheduling problem. The evolution of th...
Here we study the discrete lot-sizing problem with an initial stock variable and an associated varia...
We consider the classical lot-sizing problem with constant production capacities (LCC) and a variant...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
© 2018 Elsevier Ltd In this paper, we consider the multistage stochastic lot sizing problem with con...
Abstract We study the polyhedral structure of the static probabilistic lot-sizing problem and propos...
Within a partnership with a consulting company, we address a production problem modeled as a stochas...
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. Wh...
International audienceWe consider a stochastic lot-sizing problem and study a chance-constraint prog...
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
Given rational numbers C_0,...,C_m and b_0,...,b_m, the mixing set with arbitrary capacities is the ...
International audienceWe study the uncapacitated lot-sizing problem with uncertain demand and costs....
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a sc...
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated l...
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated l...
This paper addresses a particular stochastic lot-sizing and scheduling problem. The evolution of th...
Here we study the discrete lot-sizing problem with an initial stock variable and an associated varia...
We consider the classical lot-sizing problem with constant production capacities (LCC) and a variant...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
© 2018 Elsevier Ltd In this paper, we consider the multistage stochastic lot sizing problem with con...
Abstract We study the polyhedral structure of the static probabilistic lot-sizing problem and propos...
Within a partnership with a consulting company, we address a production problem modeled as a stochas...
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. Wh...
International audienceWe consider a stochastic lot-sizing problem and study a chance-constraint prog...
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
Given rational numbers C_0,...,C_m and b_0,...,b_m, the mixing set with arbitrary capacities is the ...
International audienceWe study the uncapacitated lot-sizing problem with uncertain demand and costs....
DOI
Add to ORKG