The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
- 28 April 2009
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 157 (8), 1806-1824
- https://doi.org/10.1016/j.dam.2009.01.004
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A discrete EOQ problem is solvable in O(logn) timeEuropean Journal of Operational Research, 2008
- EOQ revisited: The case of unequal and integral order quantitiesInternational Journal of Production Economics, 2007
- Improved rounding procedures for the discrete version of the capacitated EOQ problemEuropean Journal of Operational Research, 2005
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobsEuropean Journal of Operational Research, 2005
- Continuous and Discrete Shipping Strategies for the Single Link ProblemTransportation Science, 2002
- Warehouse sizing to minimize inventory and storage costsNaval Research Logistics (NRL), 2001
- Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity ProblemAnnals of Operations Research, 2001
- Makespan minimization in the two‐machine flowshop batch scheduling problemNaval Research Logistics (NRL), 2000
- Analyzing trade-offs between transportation, inventory and production costs on freight networksTransportation Research Part B: Methodological, 1985
- Lot sizing for products with finite demand horizon and periodic review inventory policyEuropean Journal of Operational Research, 1982