In this paper we develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. We show that the computed value function converges quadratically ...
The problem of plant layout has generally been treated as a static one. In this paper, we deal with the dynamic nature of this problem. Both optimal and heuristic procedures are developed for this ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback