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

Ioannis Fragkos; Kerem Akartunali; Mahdi Doostmohammadi

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

Ioannis Fragkos, Kerem Akartunali, Mahdi Doostmohammadi

Management Science

Research output: Contribution to conference › Paper

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 language	English
Pages	111-115
Number of pages	5
Publication status	Published - 24 Aug 2015
Event	International Workshop on Lot-Sizing - University of Montreal, HEC, Montreal, Canada Duration: 24 Aug 2015 → 26 Aug 2015 http://www.emse.fr/~absi/IWLS2015/

Conference

Conference	International Workshop on Lot-Sizing
Abbreviated title	IWLS 2015
Country/Territory	Canada
City	Montreal
Period	24/08/15 → 26/08/15
Internet address	http://www.emse.fr/~absi/IWLS2015/

Keywords

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

Cite this

@conference{d18dca51fa97439bba5a4f61a95e553a,

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

abstract = "The multi-item Capacitated Lot-sizing problem with Setup Times (CLST) isan important problem from both a theoretical and a practical perspective. Thistalk is part of a research stream that studies two-period relaxations of CLST.We present computational experiments that investigate the strength of validinequalities that are derived from two-period relaxations. Four families of validinequalities are considered, all of which are generalisations of cover inequalities,as described in Padberg et al. We present a numerical study in which wecompare the strength of these inequalities with the (l, S) inequalities of Baranyet al. We find that, for certain instances, some families are very efficient,and are able to improve the lower bound by a great margin.",

keywords = " lot-sizing problems, big-bucket capacities, nonzero setup times, polyhedral structure, inequalities, two-period relaxations",

author = "Ioannis Fragkos and Kerem Akartunali and Mahdi Doostmohammadi",

year = "2015",

month = aug,

day = "24",

language = "English",

pages = "111--115",

note = "International Workshop on Lot-Sizing, IWLS 2015 ; Conference date: 24-08-2015 Through 26-08-2015",

url = "http://www.emse.fr/~absi/IWLS2015/",

}

TY - CONF

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

AU - Fragkos, Ioannis

AU - Akartunali, Kerem

AU - Doostmohammadi, Mahdi

PY - 2015/8/24

Y1 - 2015/8/24

N2 - The multi-item Capacitated Lot-sizing problem with Setup Times (CLST) isan important problem from both a theoretical and a practical perspective. Thistalk is part of a research stream that studies two-period relaxations of CLST.We present computational experiments that investigate the strength of validinequalities that are derived from two-period relaxations. Four families of validinequalities are considered, all of which are generalisations of cover inequalities,as described in Padberg et al. We present a numerical study in which wecompare the strength of these inequalities with the (l, S) inequalities of Baranyet al. We find that, for certain instances, some families are very efficient,and are able to improve the lower bound by a great margin.

AB - The multi-item Capacitated Lot-sizing problem with Setup Times (CLST) isan important problem from both a theoretical and a practical perspective. Thistalk is part of a research stream that studies two-period relaxations of CLST.We present computational experiments that investigate the strength of validinequalities that are derived from two-period relaxations. Four families of validinequalities are considered, all of which are generalisations of cover inequalities,as described in Padberg et al. We present a numerical study in which wecompare the strength of these inequalities with the (l, S) inequalities of Baranyet al. We find that, for certain instances, some families are very efficient,and are able to improve the lower bound by a great margin.

KW - lot-sizing problems

KW - big-bucket capacities

KW - nonzero setup times

KW - polyhedral structure

KW - inequalities

KW - two-period relaxations

UR - http://www.emse.fr/~absi/IWLS2015/

UR - http://www.emse.fr/~absi/IWLS2015/proceedings_IWLS_2015.pdf

M3 - Paper

SP - 111

EP - 115

T2 - International Workshop on Lot-Sizing

Y2 - 24 August 2015 through 26 August 2015

ER -

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

Abstract

Conference

Keywords

Other files and links

Fingerprint

Multi-Item Production Planning: Theory, Computation and Practice

Cite this

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

Abstract

Conference

Keywords

Other files and links

Fingerprint

Projects

Multi-Item Production Planning: Theory, Computation and Practice

Cite this