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

DOI10.1016/j.ejor.2008.06.007zbMath1157.90510OpenAlexW2033681020MaRDI QIDQ1011324

Chung-Lun Li

Publication date: 8 April 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.06.007

zbMATH Keywords

combinatorial optimizationEOQinventory management

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (3)

Inventory model with fuzzy lead-time and dynamic demand over finite time horizon using a multi-objective genetic algorithm ⋮ Solving a finite horizon EPQ problem with backorders ⋮ A SIMPLE SOLUTION METHOD FOR THE FINITE HORIZON EOQ MODEL FOR DETERIORATING ITEMS WITH COST CHANGES

Cites Work

• Unnamed Item
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• Combining binary search and Newton's method to compute real roots for a class of real functions
• A discrete EOQ problem is solvable in \(O(\log n)\) time

This page was built for publication: A new solution method for the finite-horizon discrete-time EOQ problem