A Note on ‘An Approximate Solution to Deterministic Systems’
指出Moeeni和Chang提出的看板系统公式可能导致不可行解，通过简单数值例子说明问题，并提出修正公式以确保可行性，最后讨论修正的意义和未来研究方向。
In a recent paper, Moeeni and Chang (1990) presented an efficient heuristic solution method to solve a specific case of a deterministic kanban system. In this paper, we first provide a simple numerical example to show that the kanban system formulation proposed by Moeeni and Chang can result in infeasible solutions. We then present a modified formulation and show its feasibility. We discuss the implications of the corrected formulation and finally present conclusions and future research directions.