Open AccessNote—On the Optimal Packaging Frequency of Products Jointly Replenished
Author(s) -
Fred Andres,
Hamilton Emmons
Publication year - 1976
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.10.1165
Subject(s) - constant (computer programming) , product (mathematics) , computer science , unit (ring theory) , mathematical optimization , process engineering , mathematics , engineering , mathematics education , geometry , programming language
Goyal [Goyal, S. K. 1974. Determination of the optimum packaging frequency of items jointly replenished. Management Sci. 21 (4, December) 436-443.] proposes an algorithm for the purposes of determining the optimal packaging frequency of products that may be jointly replenished. Each time a packaging run is made, costs include a fixed setup cost independent of the number of products packaged, plus an extra setup cost for each product packaged. Holding costs are assumed constant per unit of product per unit time, demand per item is constant, and no back-logging is allowed. While Goyal's algorithm probably gives a good solution, we note some shortcomings.