Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales

DOI10.1016/j.ejor.2015.10.054zbMath1346.90029OpenAlexW1863314402MaRDI QIDQ322424

Christophe Rapine, G. Massonnet, Jean-Philippe Gayon, Gautier Stauffer

Publication date: 7 October 2016

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

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

zbMATH Keywords

inventory controlapproximation algorithmsdistribution systemslot-sizing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)

Related Items

Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem ⋮ <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs ⋮ A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities

Cites Work

• Unnamed Item
• Unnamed Item
• Uncapacitated lot sizing with backlogging: the convex hull
• Lot-size models with backlogging: Strong reformulations and cutting planes
• Computational complexity of uncapacitated multi-echelon production planning problems
• Polyhedra for lot-sizing with Wagner-Whitin costs
• The single-item lot-sizing problem with immediate lost sales
• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• Dynamic Version of the Economic Lot Size Model
• 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
• A threshold of ln n for approximating set cover
• A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
• Inventory Models with Shelf-Age and Delay-Dependent Inventory Costs
• A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
• Improved Algorithms for Economic Lot Size Problems
• Better Approximation Bounds for the Joint Replenishment Problem
• Primal-Dual Algorithms for Deterministic Inventory Problems
• Lot sizing with bounded inventory and lost sales
• A Deterministic Multi-Period Production Scheduling Model with Backlogging