A note on ‘An Approximate Solution to Deterministic Kanban Systems’: A commentary and further insights

In a recent paper, Vemuganti, Batta, and Zhu stated that the linear programming model suggested by Moeeni and Chang could result in infeasibility. They also suggested an alternative mathematical formulation for determining the number of kanbans. The intention of this article is twofold. First, we maintain that the finding of Vemuganti et al., while valid, is based on a misplaced emphasis on the purpose of the Moeeni and Chang article. Second, we demonstrate that the Vemuganti et al. formulation is a special case of a more general model proposed by Bitran and Chang.