Premium
A Note on ‘An Approximate Solution to Deterministic Kanban Systems’: A Commentary and Further Insights
Author(s) -
Moeeni Farhad,
Chang YihLong
Publication year - 1996
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1996.tb01837.x
Subject(s) - kanban , computer science , operations research , linear programming , mathematical economics , emphasis (telecommunications) , mathematical optimization , industrial engineering , management science , mathematics , algorithm , economics , artificial intelligence , engineering , telecommunications , control (management)
In a recent paper, Vemuganti, Batta, and Zhu (1996) stated that the linear programming model suggested by Moeeni and Chang (1990) 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 (1987).