Comment on “A Dynamic Programming Approach for Joint Replenishment Under General Order Cost Functions”

Rosenblatt and Kaspi (Rosenblatt, M. J., M. Kaspi. 1985. A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. 31 (March) 369–373.) suggested a dynamic programming algorithm for partitioning a number of items ordered from a single supplier. It was assumed that items belonging to a group have a fixed common ordering cycle. Queyranne (Queyranne, M. 1987. Comment on a dynamic programming algorithm for joint replenishment under general order cost. Management Sci. 33 (1, January) 131–133.) in his comments on Rosenblatt and Kaspi described the correct dynamic programming algorithm for this optional partitioning problem.

• 저널Management Science · 33(1) · 133–135
• 토픽Assembly Line Balancing Optimization · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.33.1.133
• 저자S.K. Goyal