AN APPROXIMATE SOLUTION TO DETERMINISTIC KANBAN SYSTEMS

被引：21

作者：

MOEENI, F ^{[1
]}

CHANG, YL ^{[1
]}

机构：

[1] GEORGIA INST TECHNOL,COLL MANAGEMENT,ATLANTA,GA 30332

来源：

DECISION SCIENCES | 1990年 / 21卷 / 03期

关键词：

Heuristics; Plant Design; Production/Operations Management;

D O I：

10.1111/j.1540-5915.1990.tb00337.x

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. Copyright © 1990, Wiley Blackwell. All rights reserved

引用

页码：596 / 607

页数：12

共 12 条

[1] A MATHEMATICAL-PROGRAMMING APPROACH TO A DETERMINISTIC KANBAN SYSTEM [J].