Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Production Research Année : 2011

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

Michel Minoux
  • Fonction : Auteur
  • PersonId : 957885
Yves Dallery

Résumé

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.
Fichier non déposé

Dates et versions

hal-01264958 , version 1 (29-01-2016)

Identifiants

Citer

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, 2011, 49 (9), pp.2587 - 2603. ⟨10.1080/00207543.2010.532927⟩. ⟨hal-01264958⟩
56 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More