User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

Formulations for multi-item discrete lot-sizing problems

Primary tabs

Miller, Andrew [Université Bordeaux 1 ] Wolsey, Laurence [UCL]

This paper discusses mixed-integer programming formulations of variants of the discrete lot-sizing problem. Our approach is to identify simple mixed-integer sets within these models and to apply tight formulations for these sets. This allows us to define integral linear programming formulations for the discrete lot-sizing problem in which backlogging and/or safety stocks are present, and to give extended formulations for other cases. The results help significantly to solve test cases arising from an industrial application motivating this research.

Document type Article de périodique (Journal article)
Access type Accès restreint
Publication date 2003
Language Anglais
Journal information "Operations Research" - Vol. 51, no. 4, p. 557-565 (Juillet 2003)
Peer reviewed yes
issn 0030-364X
Publication status Publié
Affiliations Université Bordeaux 1 - Institut de Mathématiques de Bordeaux
UCL - EUEN/CORE - Center for operations research and econometrics
Keywords Integer programming: convex integer programming ; Facets ; Extended formulations ; Inventory/production: scale-diseconomies/lot-sizing ; Discrete lot-sizing ; Production/scheduling: planning
Links
Bibliographic reference Miller, Andrew ; Wolsey, Laurence. Formulations for multi-item discrete lot-sizing problems. In: Operations Research, Vol. 51, no. 4, p. 557-565 (Juillet 2003)
Permanent URL http://hdl.handle.net/2078.1/23079