MODELING AND ANALYSIS OF 3-STAGE TRANSFER LINES WITH UNRELIABLE MACHINES AND FINITE BUFFERS

被引:113
作者
GERSHWIN, SB [1 ]
SCHICK, IC [1 ]
机构
[1] SCI SYST INC,CAMBRIDGE,MA
关键词
CHEMICAL OPERATIONS - COMPUTER SYSTEMS; DIGITAL;
D O I
10.1287/opre.31.2.354
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In an important class of systems, which arises in manufacturing, chemical process, and computer contexts, objects move sequentially from one work station to another, and rest between stations in buffers. In the manufacturing context, such systems are called transfer lines. The dynamic behavior of a buffered transfer line with unreliable work stations is modeled as a Markov chain. The system states consist of the operational conditions of the work stations and the levels of material in the buffers. The steady-state probabilities of these states are sought in order to establish relationships between system parameters and performance measures such as production rate (efficiency), forced-down times, and expected in-process inventory. The steady state probabilities are found by choosing a sum-of-products form solution for a class of states, and deriving the remaining expressions by using the transition equations.
引用
收藏
页码:354 / 380
页数:27
相关论文
共 65 条
[1]  
AMMAR MH, 1980, LIDSTM1046 MIT LAB I
[2]  
AMMAR MH, 1980, 1980 P IEEE C DEC CO
[3]  
ANDERSON DR, 1968, THESIS PURDUE U
[4]  
ANDERSON DR, 1969, INT J PROD RES, V7, P233
[5]  
ARTAMONOV GT, 1977, CYBERNETICS, V12, P464
[6]   A SEQUENCE OF 2 SERVERS WITH NO INTERMEDIATE QUEUE [J].
AVIITZHAK, B ;
YADIN, M .
MANAGEMENT SCIENCE, 1965, 11 (05) :553-564
[7]  
BARLOW RE, 1975, STATISTICAL THEORY R
[8]  
BARTEN K, 1962, J IND ENG, V13, P247
[9]   OPEN, CLOSED, AND MIXED NETWORKS OF QUEUES WITH DIFFERENT CLASSES OF CUSTOMERS [J].
BASKETT, F ;
CHANDY, KM ;
MUNTZ, RR ;
PALACIOS, FG .
JOURNAL OF THE ACM, 1975, 22 (02) :248-260
[10]  
Bellman R., 1970, INTRO MATRIX ANAL