The Dynamics of Plant Layout
研究工厂布局的动态规划问题，提出基于动态规划的最优和启发式算法，并讨论规划期延长及系统波动时的应对策略。
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 problem and are based on a dynamic programming formulation. The use of one of these approaches depends on the ability to solve the static problem efficiently. Finally, we briefly discuss the issue of extending the planning horizon, and how to resolve system nervousness when previously planned layouts need to be changed.