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

S. K. Goyal
Additional contact information
S. K. Goyal: Department of Quantitative Methods, Concordia University, 1455 de Maisonneuve Blvd. West, Montreal, Quebec, Canada H3G 1M8

Management Science, 1987, vol. 33, issue 1, 133-135

Abstract: 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.

Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.33.1.133 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:33:y:1987:i:1:p:133-135

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().