Approximation algorithms for the joint replenishment problem with deadlines

DOI10.1007/s10951-014-0392-yzbMath1333.90015arXiv1212.3233OpenAlexW2113638822MaRDI QIDQ906550

N. E. Zubov

Publication date: 22 January 2016

Published in: Journal of Scheduling, Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.3233

zbMATH Keywords

linear programmingapproximation algorithmNP-completenessapproximation algorithmsrandomized roundingAPX-hardnessintegrality gapjoint replenishment probleminventory theoryjoint replenishment problem with deadlines

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (7)

Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem ⋮ 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 ⋮ Online Algorithms for Multilevel Aggregation ⋮ Integrated Supply Chain Management via Randomized Rounding ⋮ New results on multi-level aggregation ⋮ An extension of the stochastic joint-replenishment problem under the class of cyclic policies

Cites Work

• Computational complexity of uncapacitated multi-echelon production planning problems
• Some APX-completeness results for cubic graphs
• Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
• A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
• APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
• Better Approximation Bounds for the Joint Replenishment Problem
• Primal-Dual Algorithms for Deterministic Inventory Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation algorithms for the joint replenishment problem with deadlines