An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

Tao Wu, Leyuan Shi, Joseph Geunes, Kerem Akartunali

Research output: Contribution to journalArticle

56 Citations (Scopus)

Abstract

This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions.
LanguageEnglish
Pages428-441
Number of pages14
JournalEuropean Journal of Operational Research
Volume214
Issue number2
Early online date5 May 2011
DOIs
Publication statusPublished - 16 Oct 2011

Fingerprint

Backlogging
Lot Sizing
Lower bound
Linear Programming Relaxation
Optimization
Mixed Integer Programming
Integer programming
Linear programming
Programming Model
Computational Results
Optimal Solution
Formulation
Framework
Lot sizing
Lower bounds
Mixed integer programming
Optimal solution

Keywords

  • capacitated
  • multi-level
  • lot-sizing
  • backlogging
  • lower and upper bound guided nested
  • partitions

Cite this

@article{b24e60f35cf742dc918aed93556bee9c,
title = "An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging",
abstract = "This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions.",
keywords = "capacitated, multi-level, lot-sizing, backlogging, lower and upper bound guided nested, partitions",
author = "Tao Wu and Leyuan Shi and Joseph Geunes and Kerem Akartunali",
year = "2011",
month = "10",
day = "16",
doi = "10.1016/j.ejor.2011.04.029",
language = "English",
volume = "214",
pages = "428--441",
journal = "European Journal of Operational Research",
issn = "0377-2217",
number = "2",

}

An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. / Wu, Tao; Shi, Leyuan; Geunes, Joseph ; Akartunali, Kerem.

In: European Journal of Operational Research, Vol. 214, No. 2, 16.10.2011, p. 428-441.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

AU - Wu, Tao

AU - Shi, Leyuan

AU - Geunes, Joseph

AU - Akartunali, Kerem

PY - 2011/10/16

Y1 - 2011/10/16

N2 - This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions.

AB - This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions.

KW - capacitated

KW - multi-level

KW - lot-sizing

KW - backlogging

KW - lower and upper bound guided nested

KW - partitions

U2 - 10.1016/j.ejor.2011.04.029

DO - 10.1016/j.ejor.2011.04.029

M3 - Article

VL - 214

SP - 428

EP - 441

JO - European Journal of Operational Research

T2 - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -