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

DOI10.1016/J.EJOR.2003.10.056zbMATH Open1066.90003OpenAlexW2011850004MaRDI QIDQ1779529FDOQ1779529

Authors: 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

Recommendations

• Rounding procedures for the discrete version of the capacitated economic order quantity problem
• Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
• The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
• Analysis of practical policies for a single link distribution system
• Analysis of the best double frequency policy in the single link problem with discrete shipping times

zbMATH Keywords

InventoryWorst-case analysisTransportationFrequency-based policies

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Cites Work

• Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems
• Title not available (Why is that?)
• One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
• On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
• Distribution Strategies that Minimize Transportation and Inventory Costs
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• Analysis of practical policies for a single link distribution system
• Rounding procedures for the discrete version of the capacitated economic order quantity problem
• Probabilistic analyses and practical algorithms for inventory-routing models
• Minimizing Transportation and Inventory Costs for Several Products on a Single Link
• Determining Optimal Reorder Intervals in Capacitated Production-Distribution Systems
• Continuous and Discrete Shipping Strategies for the Single Link Problem

Cited In (8)

• Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
• A simple solution method for the finite horizon eoq model for deteriorating items with cost changes
• An effective matheuristic for the capacitated total quantity discount problem
• An inventory-transportation system with stochastic demand
• The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
• A discrete EOQ problem is solvable in \(O(\log n)\) time
• Rounding procedures for the discrete version of the capacitated economic order quantity problem
• Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems

This page was built for publication: Improved rounding procedures for the discrete version of the capacitated EOQ problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779529)