A new solution method for the finite-horizon discrete-time EOQ problem

Chung-Lun Li

doi:10.1016/j.ejor.2008.06.007

A new solution method for the finite-horizon discrete-time EOQ problem

Chung-Lun Li

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

9 Citations (Scopus)

Abstract

We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O (log n) time. In this note, we present a modified solution method, which can determine the optimal solution without the need of such a search. © 2008 Elsevier B.V. All rights reserved.

Original language	English
Pages (from-to)	412-414
Journal	European Journal of Operational Research
Volume	197
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2008.06.007
Publication status	Published - 16 Aug 2009
Externally published	Yes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Research Keywords

Combinatorial optimization
EOQ
Inventory management

Access Output

10.1016/j.ejor.2008.06.007

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{8b0bc817a1a845e796d28940d9bebfb6,

title = "A new solution method for the finite-horizon discrete-time EOQ problem",

abstract = "We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O (log n) time. In this note, we present a modified solution method, which can determine the optimal solution without the need of such a search. {\textcopyright} 2008 Elsevier B.V. All rights reserved.",

keywords = "Combinatorial optimization, EOQ, Inventory management",

author = "Chung-Lun Li",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "2009",

month = aug,

day = "16",

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

language = "English",

volume = "197",

pages = "412--414",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A new solution method for the finite-horizon discrete-time EOQ problem

AU - Li, Chung-Lun

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2009/8/16

Y1 - 2009/8/16

N2 - We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O (log n) time. In this note, we present a modified solution method, which can determine the optimal solution without the need of such a search. © 2008 Elsevier B.V. All rights reserved.

AB - We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O (log n) time. In this note, we present a modified solution method, which can determine the optimal solution without the need of such a search. © 2008 Elsevier B.V. All rights reserved.

KW - Combinatorial optimization

KW - EOQ

KW - Inventory management

UR - http://www.scopus.com/inward/record.url?scp=59649129801&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-59649129801&origin=recordpage

U2 - 10.1016/j.ejor.2008.06.007

DO - 10.1016/j.ejor.2008.06.007

M3 - RGC 21 - Publication in refereed journal

SN - 0377-2217

VL - 197

SP - 412

EP - 414

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

A new solution method for the finite-horizon discrete-time EOQ problem

Abstract

Bibliographical note

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this