A note on ‘An Approximate Solution to Deterministic Systems’

In a recent paper, Moeeni and Chang 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.