Abstract We consider a lot-sizing problem with set-ups where the demands are uncertain, and propose novel approach to evaluate inventory costs. An interval uncertainty is assumed for demands. Between two consecutive production periods, adversary chooses set demand either its higher value or lower in order maximize (holding backlog) A mixed-integer model devised column-and-row generation algorit...

Despite its great applicability in several industries, the combined cutting stock and lot-sizing problem has not been sufficiently studied because of its great complexity. This paper analyses the trade-off that arises when we solve the cutting stock problem by taking into account the production planning for various periods. An optimal solution for the combined problem probably contains non-opti...

The paper deals with a stochastic multi-product sequencing and lot-sizing problem for a line that produces items in lots. Two types of uncertainties are considered: random lead time induced by machine breakdowns and random yield to take into account part rejects. In addition, sequence dependent setup times are also included. This study focuses on maximizing the probability of producing a requir...

The paper deals with a stochastic multi-product sequencing and lot-sizing problem for a line that produces items in lots. Two types of uncertainties are considered: random lead time induced by machine breakdowns and random yield to take into account part rejects. In addition, sequence dependent setup times are also included. This study focuses on maximizing the probability of producing a requir...

We consider a variant of the single item lot sizing problem where the product, when stored, suffers from a proportional loss, and in which the product demand is affected by uncertainty. This setting is particularly relevant in the energy sector, where the demands must be satisfied in a timely manner and storage losses are, often, unavoidable. We propose a two-stage robust optimization approach ...

In this paper, we consider the well-known constant-batch lot-sizing problem, which we refer to as the single module capacitated lot-sizing (SMLS) problem, and multi-module capacitated lot-sizing (MMLS) problem. We provide sufficient conditions under which the (k, l, S, I) inequalities of Pochet and Wolsey (Math of OR 18: 767-785, 1993), the mixed (k, l, S, I) inequalities, derived using mixing ...