Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/44995
Title: | Kanban assignment problem in serial just-in-time production systems | Authors: | Co, Henry C. Jacobson, Sheldon H. |
Issue Date: | 1994 | Citation: | Co, Henry C.,Jacobson, Sheldon H. (1994). Kanban assignment problem in serial just-in-time production systems. IIE Transactions (Institute of Industrial Engineers) 26 (2) : 76-85. ScholarBank@NUS Repository. | Abstract: | 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. | Source Title: | IIE Transactions (Institute of Industrial Engineers) | URI: | http://scholarbank.nus.edu.sg/handle/10635/44995 | ISSN: | 0740817X |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.