Skip to Main content Skip to Navigation
Journal articles

Multi-product valid inequalities for the discrete lot-sizing and scheduling problem

Céline Gicquel 1 Michel Minoux 2
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We consider a problem arising in the context of industrial production planning, namely the multi-product discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. We aim at developing an exact solution approach based on a Cut & Branch procedure for this combinatorial optimization problem. To achieve this, we propose a new family of multi-product valid inequalities which corresponds to taking into account the conflicts between different products simultaneously requiring production on the resource. We then present both an exact and a heuristic separation algorithm which form the basis of a cutting-plane generation algorithm. We finally discuss computational results which confirm the practical usefulness of the proposed inequalities at strengthening the MILP formulation and at reducing the overall computation time.
Document type :
Journal articles
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Céline Gicquel <>
Submitted on : Wednesday, January 27, 2016 - 2:25:49 PM
Last modification on : Wednesday, September 16, 2020 - 4:59:38 PM
Long-term archiving on: : Thursday, April 28, 2016 - 11:22:34 AM


Files produced by the author(s)



Céline Gicquel, Michel Minoux. Multi-product valid inequalities for the discrete lot-sizing and scheduling problem. Computers and Operations Research, Elsevier, 2015, 54, pp.12-20. ⟨10.1016/j.cor.2014.08.022⟩. ⟨hal-01262267⟩



Record views


Files downloads