Open AccessNote—Note on “Determination of Optimum Packaging Frequency of Items Jointly Replenished”
Author(s) -
S. K. Goyal
Publication year - 1975
Publication title -
management science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.954
H-Index - 255
eISSN - 1526-5501
pISSN - 0025-1909
DOI - 10.1287/mnsc.22.3.386
Subject(s) - upper and lower bounds , set (abstract data type) , computer science , mathematical optimization , algorithm , mathematics , mathematical analysis , programming language
In my paper [Goyal, S. K. 1974. Determination of optimum packaging frequency of items jointly replenished. Management Sci. 21 (4, December) 436-443.], an algorithm is given for determining the optimum packaging frequency of jointly replenished items. Essentially the procedure involves determining the lower bound and upper bound for the frequency of manufacturing set-ups and then choosing the optimum policy which provide minimum cost from a limited number of policies within the lower bound and upper bound of the manufacturing frequency. The effectiveness of the algorithm can be improved by redefining the upper bound of the manufacturing frequency and modifying a step of the original algorithm.