Modeling the blocking phenomenon in JIT environment: An alternative scenario

被引:6
作者
Siha, S
机构
[1] Kennesaw State College, Marietta
关键词
D O I
10.1016/0360-8352(95)00029-1
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Queueing networks with blocking have proven useful in modeling computer systems, telecommunication systems, production systems and public services. In this paper, an alternative scenario of the blocking mechanism is presented and its pertinence to JIT systems is explained. For comparison purposes, we apply the traditional scenario of blocking mechanism to the same class of queueing systems. Numerical results show that the values of the performance measures of the two scenarios are close within certain ranges of system parameters. The presented scenario is easier to solve and can be modeled more efficiently.
引用
收藏
页码:61 / 75
页数:15
相关论文
共 21 条
[1]  
ALTIOK T, 1982, EUR J OPERL RES, V5, P390
[2]  
ALTIOK TM, 1982, IIE TRANS, V14, P125
[3]   A SEQUENCE OF 2 SERVERS WITH NO INTERMEDIATE QUEUE [J].
AVIITZHAK, B ;
YADIN, M .
MANAGEMENT SCIENCE, 1965, 11 (05) :553-564
[4]   A SEQUENCE OF SERVICE STATIONS WITH ARBITRARY INPUT AND REGULAR SERVICE TIMES [J].
AVIITZHAK, B .
MANAGEMENT SCIENCE, 1965, 11 (05) :565-571
[5]  
Buzacott John A., 1972, null, V4, P308, DOI DOI 10.1080/05695557208974867
[6]   ON THE REVERSIBILITY OF MANUFACTURING NETWORKS [J].
CORTEN, M ;
DEKOSTER, R .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1990, 145 (02) :309-327
[7]  
FADDEV DK, 1963, COMPUTATIONAL METHOD, P193
[8]   ON THE BLOCKING-PROCESS IN QUEUE NETWORKS [J].
FOSTER, FG ;
PERROS, HG .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 5 (04) :276-283
[9]   AN EFFICIENT DECOMPOSITION METHOD FOR THE APPROXIMATE EVALUATION OF TANDEM QUEUES WITH FINITE STORAGE SPACE AND BLOCKING [J].
GERSHWIN, SB .
OPERATIONS RESEARCH, 1987, 35 (02) :291-305
[10]   ANALYSIS OF TRANSFER LINES CONSISTING OF 2 UNRELIABLE MACHINES WITH RANDOM PROCESSING TIMES AND FINITE STORAGE BUFFERS [J].
GERSHWIN, SB ;
BERMAN, O .
AIIE TRANSACTIONS, 1981, 13 (01) :2-11