A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A constant approximation algorithm for the one-warehouse multi-retailer problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Mathematical Programming: Series A and B
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Dynamic Version of the Economic Lot Size Model
Management Science
Primal-Dual Algorithms for Deterministic Inventory Problems
Mathematics of Operations Research
Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules
Operations Research
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Fully Distribution-Free Profit Maximization: The Inventory Management Case
Mathematics of Operations Research
Online lot-sizing problems with ordering, holding and shortage costs
Operations Research Letters
Approximation algorithms for the joint replenishment problem with deadlines
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Online control message aggregation in chain networks
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
ACM SIGACT News
| Hi-index | 0.00 |
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental role in broader planning issues, such as the management of supply chains. In contrast to the traditional approaches of the stochastic inventory theory, we study the problem using competitive analysis against a worst-case adversary. Our main result is a 3-competitive deterministic algorithm for the online version of the JRP. We also prove a lower bound of approximately 2.64 on the competitiveness of any deterministic online algorithm for the problem. Our algorithm is based on a novel primal-dual approach using a new linear programming relaxation of the offline JRP model. The primal-dual approach that we propose departs from previous primal-dual and online algorithms in rather significant ways. We believe that this approach can extend the range of problems to which online and primal-dual algorithms can be applied and analyzed.