A Note on "The Economic Lot Sizing Problem With Inventory Bounds"

M Onal; Wilco van den Heuvel; T Liu

doi:10.1016/j.ejor.2012.05.019

A Note on "The Economic Lot Sizing Problem With Inventory Bounds"

M Onal, Wilco van den Heuvel, T Liu

Econometrics

Research output: Contribution to journal › Article › Academic › peer-review

12 Citations (Scopus)

Abstract

In a recent paper, Liu [3] considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains the O(n2) complexity.

Original language	English
Pages (from-to)	290-294
Number of pages	5
Journal	European Journal of Operational Research
Volume	223
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2012.05.019
Publication status	Published - 2012

Access to Document

10.1016/j.ejor.2012.05.019

http://hdl.handle.net/1765/76586

Cite this

@article{acb5c926faa54b38ac0e68060de62c5e,

title = "A Note on {"}The Economic Lot Sizing Problem With Inventory Bounds{"}",

abstract = "In a recent paper, Liu [3] considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains the O(n2) complexity.",

author = "M Onal and {van den Heuvel}, Wilco and T Liu",

year = "2012",

doi = "10.1016/j.ejor.2012.05.019",

language = "English",

volume = "223",

pages = "290--294",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - A Note on "The Economic Lot Sizing Problem With Inventory Bounds"

AU - Onal, M

AU - van den Heuvel, Wilco

AU - Liu, T

PY - 2012

Y1 - 2012

N2 - In a recent paper, Liu [3] considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains the O(n2) complexity.

AB - In a recent paper, Liu [3] considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains the O(n2) complexity.

U2 - 10.1016/j.ejor.2012.05.019

DO - 10.1016/j.ejor.2012.05.019

M3 - Article

VL - 223

SP - 290

EP - 294

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -

A Note on "The Economic Lot Sizing Problem With Inventory Bounds"

Abstract

Access to Document

Fingerprint

Cite this