THE KANBAN ASSIGNMENT PROBLEM IN SERIAL JUST-IN-TIME PRODUCTION SYSTEMS
作者:
HENRYC. CO,
SHELDONH. JACOBSON,
期刊:
IIE Transactions
(Taylor Available online 1994)
卷期:
Volume 26,
issue 2
页码: 76-85
ISSN:0740-817X
年代: 1994
DOI:10.1080/07408179408966598
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
This paper examines multi-stage serial just-in-time production systems that use kanbans as a means of communicating the production needs of each stage of operation. The kanban-controlled system is a linked-demand system. A recursive function is presented which computes the number of kanbans required for all stages of a serial production system. This function is used to compute a lower bound on the expected fill rate for an arbitrary kanban assignment.
点击下载:
PDF (804KB)
返 回