A 5/3-approximation algorithm for joint replenishment with deadlines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5573 LNCS, Issue , 2009, Pages 24-35

  Nonner, Tim ^a   Souza, Alexander ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; DELAY COSTS; HARDNESS RESULT; INAPPROXIMABILITY; JOINT REPLENISHMENT; JOINT REPLENISHMENT PROBLEM; NP-HARD; ORDERING COST; TWO STAGE;

BEVERAGES; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COST FUNCTIONS; SALES;

APPROXIMATION ALGORITHMS;

EID: 70350680306     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02026-1_3     Document Type: Conference Paper

References (17)

1. Aksoy, Y., Èrenguc, S.S.: Multi-Item Inventory Models with Co-ordinated Replenishments: A Survey. International Journal of Operations Production Management 8(1), 63-73 (1988)
2. Albers, S., Fujiwara, H.: Energy-Efficient Algorithms for Flow Time Minimization. ACM Trans. Algorithms 3(4), 49 (2007)
3. Arkin, E., Joneja, D., Roundy, R.: Computational Complexity of Uncapacitated Multi-Echelon Production Planning Problems. Operations Research Letters 8(2), 61-66 (1989)
4. Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L., Vitaletti, A.: Latency Constrained Aggregation in Sensor Networks. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 88-99. Springer, Heidelberg (2006)
5. Buchbinder, N., Kimbrel, T., Levi, R., Makarychev, K., Sviridenko, M.: Online Make-to-Order Joint Replenishment Model: Primal Dual Competitive Algorithms. In: Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 952-961 (2008)
6. Dooly, D.R., Goldman, S.A., Scott, S.D.: TCP Dynamic Acknowledgment Delay: Theory and Practice. In: Proc. of the 30th Annual ACM Symposium on the Theory of Computing (STOC), pp. 389-398 (1998)
7. Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., Sviridenko, M.: Algorithms for Capacitated Rectangle Stabbing and Lot Sizing with Joint Set-Up Costs. ACM Trans. Algorithms 4(3), Article No. 34 (2008)
8. Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. J. Algorithms 43(1), 138-152 (2002)
9. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. North-Holland Publishing Co., The Netherlands (2004)
10. Hassin, R., Megiddo, N.: Approximation Algorithms for Hitting Objects with Straight Lines. Discrete Applied Mathematics 30(1), 29-42 (1991)
11. Kao, E.: A Multi Product Dynamic Lot Size Model with Individual and Joint Setup Costs. Operations Research 27, 279-289 (1979)
12. Levi, R., Sviridenko, M.: Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 188-199. Springer, Heidelberg (2006)
13. Levi, R., Roundy, R., Shmoys, D.B.: Primal-Dual Algorithms for Deterministic Inventory Problems. In: Proc. of the 36th ACM Symposium on Theory of Computing (STOC), pp. 353-362 (2004)
14. Levi, R., Roundy, R., Shmoys, D.B.: A Constant Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. In: Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 365-374 (2005)
15. Veinott, A.: Minimum Concave Cost Solutions of Leontief Substitution Models of Multi-Facility Inventory Systems. Operations Research 17, 262-291 (1969)
16. Yao, F.F., Demers, A.J., Shenker, S.: A Scheduling Model for Reduced CPU Energy. In: Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 374-382 (1995)
17. Zangwill, W.I.: A Deterministic Multi-product Multi-Facility Production and Inventory Model. Operations Research 14, 486-507 (1966)