Improved rounding procedures for the discrete version of the capacitated EOQ problem

DOI10.1016/j.ejor.2003.10.056zbMath1066.90003MaRDI QIDQ1779529

Luca Bertazzi, Maria Grazia Speranza

Publication date: 1 June 2005

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

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

zbMATH Keywords

Inventory; Transportation; Worst-case analysis; Frequency-based policies

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B05: Inventory, storage, reservoirs

Related Items

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications, A discrete EOQ problem is solvable in \(O(\log n)\) time

Cites Work

• Unnamed Item
• Rounding procedures for the discrete version of the capacitated economic order quantity problem
• Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
• One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
• On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
• Analysis of practical policies for a single link distribution system
• Distribution Strategies that Minimize Transportation and Inventory Costs
• Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• Determining Optimal Reorder Intervals in Capacitated Production-Distribution Systems
• Minimizing Transportation and Inventory Costs for Several Products on a Single Link
• Continuous and Discrete Shipping Strategies for the Single Link Problem