THE KANBAN ASSIGNMENT PROBLEM IN SERIAL JUST-IN-TIME PRODUCTION SYSTEMS

被引：7

作者：

CO, HC ^{[1
]}

JACOBSON, SH ^{[1
]}

机构：

[1] VIRGINIA POLYTECH INST & STATE UNIV,DEPT IND & SYST ENGN,BLACKSBURG,VA 24061

来源：

IIE TRANSACTIONS | 1994年 / 26卷 / 02期

关键词：

D O I：

10.1080/07408179408966598

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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.

引用

页码：76 / 85

页数：10

共 12 条

[1]

BITRAN GR, 1987, MANAGE SCI, V3, P427

[2]

DELEERSNYDER H, 1989, MANAGE SCI, V5, P1079

[3]

Goddard W., 1982, MODERN MATERIALS HAN, P40

[4] DESIGN AND ANALYSIS OF PULL SYSTEM, A METHOD OF MULTISTAGE PRODUCTION CONTROL [J].

KIMURA, O ;

TERADA, H .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1981, 19 (03) :241-253

[5] A DYNAMIC-PROGRAMMING MODEL FOR THE KANBAN ASSIGNMENT PROBLEM IN A MULTISTAGE MULTIPERIOD PRODUCTION SYSTEM [J].

LI, AL ;

CO, HC .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (01) :1-16

[6] THE OPTIMAL OPERATION PLANNING OF KANBAN TO MINIMIZE THE TOTAL OPERATION COST [J].

MIYAZAKI, S ;

OHTA, H ;

NISHIYAMA, N .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1988, 26 (10) :1605-1611

[7]

MONDEN Y, 1981, IND ENG, V13, P22

[8]

MONDEN Y, 1981, IND ENG, V13, P42

[9]

MONDEN Y, 1981, IND ENG, V13, P29

[10]

MONDEN Y, 1981, IND ENG, V13, P36

← 1 2 →