Optimal lot size determination of multistage production system

Klapka, Jindřich L.. "Optimal lot size determination of multistage production system." Aplikace matematiky 23.2 (1978): 81-97. <http://eudml.org/doc/15040>.

@article{Klapka1978,
abstract = {This paper deals with the optimization of total setup plus inventory cost of a certain class of the multistage inventory-production systems with the series arranged production stages having generally different production rates, separated by stores from each other. The optimization is made by the choice of lot sizes across an infinite time horizon. The exact cost-optimization algorithm based on the Bellman optimality principle is derived and applied for deriving two lower bounds of the optimal cost of the above class of systems. These lowe bounds improve that derived by Crowston, Wagner and Williams. Two numerical examples are given.},
author = {Klapka, Jindřich L.},
journal = {Aplikace matematiky},
keywords = {dynamic multistage; inventory-production system; production stages; infinite horizon; dynamic model; application of dynamic programming; algorithmic computation of optimal solution; dynamic multistage; inventory-production system; production stages; infinite horizon; dynamic model; application of dynamic programming; algorithmic computation of optimal solution},
language = {eng},
number = {2},
pages = {81-97},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Optimal lot size determination of multistage production system},
url = {http://eudml.org/doc/15040},
volume = {23},
year = {1978},
}

TY - JOUR
AU - Klapka, Jindřich L.
TI - Optimal lot size determination of multistage production system
JO - Aplikace matematiky
PY - 1978
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 23
IS - 2
SP - 81
EP - 97
AB - This paper deals with the optimization of total setup plus inventory cost of a certain class of the multistage inventory-production systems with the series arranged production stages having generally different production rates, separated by stores from each other. The optimization is made by the choice of lot sizes across an infinite time horizon. The exact cost-optimization algorithm based on the Bellman optimality principle is derived and applied for deriving two lower bounds of the optimal cost of the above class of systems. These lowe bounds improve that derived by Crowston, Wagner and Williams. Two numerical examples are given.
LA - eng
KW - dynamic multistage; inventory-production system; production stages; infinite horizon; dynamic model; application of dynamic programming; algorithmic computation of optimal solution; dynamic multistage; inventory-production system; production stages; infinite horizon; dynamic model; application of dynamic programming; algorithmic computation of optimal solution
UR - http://eudml.org/doc/15040
ER -