The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications

DOI10.1016/J.DAM.2009.01.004zbMath1164.90004OpenAlexW2093851232MaRDI QIDQ1026143

J. Blot

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.004

zbMATH Keywords

EOQbatchingpolynomial algorithmdiscrete optimizationlogisticsinventory managementsupply chains

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items (5)

Cooperation on capacitated inventory situations with fixed holding costs ⋮ Joint optimization of dynamic lot and warehouse sizing problems ⋮ The warehouse-inventory-transportation problem for supply chains ⋮ A discrete EOQ problem is solvable in \(O(\log n)\) time ⋮ A SIMPLE SOLUTION METHOD FOR THE FINITE HORIZON EOQ MODEL FOR DETERIORATING ITEMS WITH COST CHANGES

Cites Work

• Unnamed Item
• Unnamed Item
• Batching and scheduling in a multi-machine flow shop
• Lot sizing for products with finite demand horizon and periodic review inventory policy
• Rounding procedures for the discrete version of the capacitated economic order quantity problem
• Improved rounding procedures for the discrete version of the capacitated EOQ problem
• A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
• A discrete EOQ problem is solvable in \(O(\log n)\) time
• Technical Note—Some Very Easy Knapsack/Partition Problems
• Minimizing Transportation and Inventory Costs for Several Products on a Single Link
• Continuous and Discrete Shipping Strategies for the Single Link Problem
• Warehouse sizing to minimize inventory and storage costs
• Global optimization

This page was built for publication: The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications