Formulations for multi-item discrete lot-sizing problems

Miller, Andrew;Wolsey, Laurence
(2003) Operations research — Vol. 51, n° 4, p. 557-565 (2003)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 318.18 KB
Request a copy

Details

Authors
  • Miller, Andreworcid-logoUniversité Bordeaux 1
    Author
  • Wolsey, LaurenceUCLouvain
    Author
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Miller, A., & Wolsey, L. (2003). Formulations for multi-item discrete lot-sizing problems. Operations research, 51(4), 557-565. https://doi.org/10.1287/opre.51.4.557.16094 (Original work published 2003)