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

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

Overview

9 Scopus Citations

Scopus Metrics

View graph of relations

Author(s)

Chung-Lun Li

Detail(s)

Original language	English
Pages (from-to)	412-414
Journal / Publication	European Journal of Operational Research
Volume	197
Issue number	1
Publication status	Published - 16 Aug 2009
Externally published	Yes

Link(s)

DOI	DOI https://doi.org/10.1016/j.ejor.2008.06.007 Final Published version
	Check@CityULib
Link to Scopus	https://www.scopus.com/record/display.uri?eid=2-s2.0-59649129801&origin=recordpage
Permanent Link	https://scholars.cityu.edu.hk/en/publications/publication(8b0bc817-a1a8-45e7-96d2-8940d9bebfb6).html

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.

Research Area(s)

Combinatorial optimization, EOQ, Inventory management

Bibliographic 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].