The submodular joint replenishment problem

DOI10.1007/s10107-015-0920-3zbMath1346.90301OpenAlexW2208994903MaRDI QIDQ304238

Maurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. Shmoys

Publication date: 25 August 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/98901

zbMATH Keywords

approximation algorithmsubmodular functioninventory managementjoint replenishment problem

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items

Improved Approximation Algorithms for Inventory Problems, Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem, The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem, Approximation algorithms for inventory problems with submodular or routing costs, Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies, Joint replenishment meets scheduling, An online joint replenishment problem combined with single machine scheduling, Supply Chain Management with Online Customer Selection, An extension of the stochastic joint-replenishment problem under the class of cyclic policies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for inventory problems with submodular or routing costs
• A faster strongly polynomial time algorithm for submodular function minimization
• Computational complexity of uncapacitated multi-echelon production planning problems
• Dynamic Version of the Economic Lot Size Model
• Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
• Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
• A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
• The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
• An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem
• Multistage Lot Sizing Problems via Randomized Rounding
• A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• A Greedy Heuristic for the Set-Covering Problem
• The Joint Replenishment Problem with General Joint Cost Structures
• Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs
• A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
• Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds
• Maintenance scheduling for modular systems: Modeling and algorithms
• The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
• An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem
• An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem
• Better Approximation Bounds for the Joint Replenishment Problem
• Primal-Dual Algorithms for Deterministic Inventory Problems
• Latency Constrained Aggregation in Sensor Networks
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
• Facility location with hierarchical facility costs