Skip to Main content Skip to Navigation
Journal articles

Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources

Céline Gicquel 1 Michel Minoux 2 Yves Dallery 1
2 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We consider a production planning problem known as the discrete lot-sizing and scheduling problem (DLSP) and study a variant of the DLSP involving several identical parallel resources. We show how to solve the resulting discrete optimisation problem as a mixed-integer linear program using a commercial MIP solver. To achieve this, we exhibit a family of strong valid inequalities for which the associated separation problem is efficiently solvable. Our computational results show that the proposed solution algorithm is capable of providing optimal solutions for medium-sized instances.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01264958
Contributor : Céline Gicquel <>
Submitted on : Friday, January 29, 2016 - 10:07:41 PM
Last modification on : Friday, January 8, 2021 - 5:32:06 PM

Identifiers

Citation

Céline Gicquel, Michel Minoux, Yves Dallery. Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources. International Journal of Production Research, Taylor & Francis, 2011, 49 (9), pp.2587 - 2603. ⟨10.1080/00207543.2010.532927⟩. ⟨hal-01264958⟩

Share

Metrics

Record views

121