A discrete EOQ problem is solvable in O (log n) time

European Journal of Operational Research

Volumn 189, Issue 3, 2008, Pages 914-919

  Kovalev, Alexandr ^a   Ng, C T ^b  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Discrete optimization; EOQ; Inventory management

Indexed keywords

PROBLEM SOLVING;

DISCRETE MINIMIZATION PROBLEM; DISCRETE OPTIMIZATION; ECONOMIC ORDER QUANTITY PROBLEM;

INVENTORY CONTROL;

EID: 40849135628     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.03.073     Document Type: Article

References (8)

1. Bertazzi L., and Speranza M.G. Rounding procedures for the discrete version of the capacitated economic order quantity problem. Annals of Operations Research 107 (2001) 33-49
2. Bertazzi L., and Speranza M.G. Continuous and discrete shipping strategies for the single link problem. Transportation Science 36/3 (2002) 314-325
3. Bertazzi L., and Speranza M.G. Improved rounding procedures for the discrete version of the capacitated EOQ problem. European Journal of Operational Research 166 (2005) 25-34
4. Blumenfeld D.E., Burns L.D., Diltz J.D., and Dazango C.F. Analyzing trade-offs between transportation, inventory and production costs on freight networks. Transportation Research B 19 (1985) 361-380
5. C.T. Ng, T.C.E. Cheng, V. Kotov, M.Y. Kovalyov, The EOQ problem with decidable warehouse capacity: analysis, solution approaches and applications, submitted for publication.
6. Speranza M.G., and Ukovich W. Minimizing transportation and inventory costs for several products on a single link. Operations Research 42/5 (1994) 879-894
7. Törn A., and Zilinskas A. Global Optimization. Lecture Notes in Computer Science Vol. 350 (1989), Springer Verlag, Heidelberg 255 pp
8. Zipkin P.H. Foundations of Inventory Management (2000), The McGraw-Hill Companies Inc. 514 pp.