TRANSIENT ANALYSIS OF MANUFACTURING SYSTEMS PERFORMANCE

被引:46
作者
NARAHARI, Y
VISWANADHAM, N
机构
[1] Indian Institute of Science, Department of Computer Science and Automation, Bangalore
来源
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 1994年 / 10卷 / 02期
关键词
D O I
10.1109/70.282547
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Studies in performance evaluation of automated manufacturing systems, using simulation or analytical models, have always emphasized steady-state or equilibrium performance in preference to transient performance. In this study, we present several situations in manufacturing systems where transient analysis is very important. Manufacturing systems and models in which such situations arise include: systems with failure states and deadlocks, unstable queueing systems, and systems with fluctuating or non-stationary workloads. Even in systems where equilibrium exists, transient analysis is important in studying issues such as accumulated performance rewards over finite intervals, first passage times, sensitivity analysis, settling time computation, and deriving the behavior of queueing models as they approach equilibrium. In certain systems, convergence to steady-state is so slow that only transient analysis can throw light on the system performance. In this paper, we focus on transient analysis of Markovian models of manufacturing systems. After presenting several illustrative manufacturing situations where transient analysis has significance, we discuss two problems for demonstrating the importance of transient analysis. The first problem is concerned with the computation of distribution of time to absorption in Markov models of manufacturing systems with deadlocks or failures, and the second problem shows the relevance of transient analysis to a multiclass manufacturing system with significant setup times. We also briefly discuss computational aspects of transient analysis.
引用
收藏
页码:230 / 244
页数:15
相关论文
共 85 条
[1]   PERFORMANCE EVALUATION OF AUTOMATED MANUFACTURING SYSTEMS USING GENERALIZED STOCHASTIC PETRI NETS [J].
ALJAAR, RY ;
DESROCHERS, AA .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1990, 6 (06) :621-639
[2]  
ANANTHARAM V, 1988, SETTLING TIME CLOSED
[3]  
ANANTHARAM V, 1989, LQUEUEING SYSTEMS TH, V5, P77
[4]  
BAI SX, 1989, MIT89518 MICR RES CT
[5]   A MATHEMATICAL-MODEL FOR TRANSIENT ANALYSIS OF COMPUTER-SYSTEMS [J].
BAIOCCHI, C ;
CAPELO, AC ;
COMINCIOLI, V ;
SERAZZI, G .
PERFORMANCE EVALUATION, 1983, 3 (04) :247-264
[6]   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
[7]   ANALYSIS OF TYPICAL FAULT-TOLERANT ARCHITECTURES USING HARP [J].
BAVUSO, SJ ;
DUGAN, JB ;
TRIVEDI, KS ;
ROTHMANN, EM ;
SMITH, WE .
IEEE TRANSACTIONS ON RELIABILITY, 1987, 36 (02) :176-185
[8]  
BELLMANN R, 1969, INTRO INITIAL VALUE
[9]  
BOBBIO A, 1986, IEEE T COMPUT, V35, P803, DOI 10.1109/TC.1986.1676840
[10]   COMPUTING CUMULATIVE MEASURES OF STIFF MARKOV-CHAINS USING AGGREGATION [J].
BOBBIO, A ;
TRIVEDI, K .
IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (10) :1291-1298