An Approximate Solution to Deterministic Kanban Systems
提出一个简单启发式方法，用于计算多阶段无容量约束装配树结构看板系统中的看板数量，实验表明该方法能快速生成优质解，适用于日常准时制生产。
ABSTRACT This paper presents a simple heuristic for computing the number of kanbans in a kanban system. The production systems under consideration have a multistage, uncapacitated, assembly tree structure, with every stage producing only one item at a time. The experimental results show that this method generates very good solutions. In more realistic problems where the master production schedule incorporates a smoothed demand, the solution found under the proposed method is identical to that of the linear programming approximation. This simple heuristic can be used in the real world to quickly determine the number of kanbans for daily just‐in‐time operations.