Decision Sciences Journal
Volume 27, Number 4
Fall 1996
A Note on 'An Approximate Solution to Deterministic Kanban
Systems': A Commentary and Further Insights
Farhad Moeeni
Department of Economics and Decision Sciences, College of Business,
Arkansas State University, State University, AR 72467,
moeeni@cherokee.astate.edu
Yih-Long Chang
The Dupree School of Management, Georgia Institute of Technology,
Atlanta, GA 30332-0520, yihlong.chang@mgt.gatech.edu
ABSTRACT
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).
Subject Areas: Heuristics, Just-In-Time Manufacturing,
Kanban Systems, and Production and Inventory Management.
|