A computational study of two-period relaxations for lot-sizing problems with big-bucket capacities

Research output: Contribution to conferencePaper

Abstract

The multi-item Capacitated Lot-sizing problem with Setup Times (CLST) is
an important problem from both a theoretical and a practical perspective. This
talk is part of a research stream that studies two-period relaxations of CLST.
We present computational experiments that investigate the strength of valid
inequalities that are derived from two-period relaxations. Four families of valid
inequalities are considered, all of which are generalisations of cover inequalities,
as described in Padberg et al. We present a numerical study in which we
compare the strength of these inequalities with the (l, S) inequalities of Barany
et al. We find that, for certain instances, some families are very efficient,
and are able to improve the lower bound by a great margin.
Original languageEnglish
Pages111-115
Number of pages5
Publication statusPublished - 24 Aug 2015
EventInternational Workshop on Lot-Sizing - University of Montreal, HEC, Montreal, Canada
Duration: 24 Aug 201526 Aug 2015
http://www.emse.fr/~absi/IWLS2015/

Conference

ConferenceInternational Workshop on Lot-Sizing
Abbreviated titleIWLS 2015
CountryCanada
CityMontreal
Period24/08/1526/08/15
Internet address

    Fingerprint

Keywords

  • lot-sizing problems
  • big-bucket capacities
  • nonzero setup times
  • polyhedral structure
  • inequalities
  • two-period relaxations

Cite this

Fragkos, I., Akartunali, K., & Doostmohammadi, M. (2015). A computational study of two-period relaxations for lot-sizing problems with big-bucket capacities. 111-115. Paper presented at International Workshop on Lot-Sizing, Montreal, Canada.