2014
DOI: 10.1016/j.ejor.2014.02.027
|View full text |Cite
|
Sign up to set email alerts
|

An evaluation of semidefinite programming based approaches for discrete lot-sizing problems

Abstract: The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problemspecific strengthening procedures developped for lot-sizing problems. Our … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 31 publications
0
1
0
Order By: Relevance
“…Several extensions and solving approaches have been proposed in the literature for the DLSP, such as [23] for costs with non-speculative motives and [7] for start-up times and backlogging in the context of a tire curing scheduling problem. More recently, the DLSP with sequence-dependent changeover costs and time is addressed in in [5]. Bi-objective formulations for the DLSP considering carbon emissions and renewable energy are presented in [10].…”
Section: Introductionmentioning
confidence: 99%
“…Several extensions and solving approaches have been proposed in the literature for the DLSP, such as [23] for costs with non-speculative motives and [7] for start-up times and backlogging in the context of a tire curing scheduling problem. More recently, the DLSP with sequence-dependent changeover costs and time is addressed in in [5]. Bi-objective formulations for the DLSP considering carbon emissions and renewable energy are presented in [10].…”
Section: Introductionmentioning
confidence: 99%