Զѧ
ACTA AUTOMATICA SINICA
1998 24 1  Vol.24  No.1 1998



ʧЧĴ
غ
̷
ժҪԻʧЧĴ߽ۣߵ״Լ״̬߱еĹغԣ˴غķõ˷ߵָ꣺̬Чȡ̬ʡƽ.ֵ˵ַЧ.
ؼʡЧȣغ㣬ʧЧ.
FLOW CONSERVATION APPROACH TO THE ANALYSIS OF
TRANSFER LINE WITH UNRELIABLE MACHINES
AND FINITE BUFFERS
TAN MIN
(Institute of Automation,Chinese Academy of Sciences,Beijing100080)
AbstractThis paper presents the flow conservation approach to analyze a transfer line with unreliable machines,random processing time and finite buffers.The states of buffers and the flow conservation are analyzed and the performance measurement of the transfer line is obtained.A numerical example is given to illustrate the effectiveness of the approach.
Key wordsEfficiency,flow conservation,failure and repair,transfer line.
1
ϵͳоѾ㷺عעԽԽߵķƼŻ.ϵͳоǴ⣬m  Mi(i=1,2,m)m-1 Bi(i=1,2,,m-1)ɣṹͼ1ʾ.ԭϹߣm˳ӹΪƷ.

ͼ1mĴ
ʧЧʧЧ. Mi ʧЧʱ Bi-1еĹӣ BiеĹ٣ȥֻ Bi ȫգBi-1ȫ.ʱMi+1ӹһ޷͵Bi-1 ж(blocked)״̬Mi+1ӹһBiȡڼ(starved)״̬.
ڿ˻ʧЧͼʹ÷״̬ά̫൱.һ·̵Ĵmm-1 Mi ֻʧЧ״̬BiKi(Mi+1ϼӹĹ)ôߵ״̬бȼһ109ɵĴߣÿ9ô߹1.021012״̬һϵͳ൱.
һӵ⣬ܶרѧ߶˲ͬķ.ĴߣBuzaccott1һƵķ֮Gershwin Berman2ݸһȷķ.mߣĿǰΪֹûһȷķ.Gershwin3һַֽ(decomposition)ķƷߵܣDallery et al45ݣHong6ݣChong & Gershwin7ݺGershwin8ݶԷֽķֱַϸоAncelin & Semery  Terracol & David ֱһּ(aggregation)Koster910ݶԼ˽ܲߵܣף11һֵЧվĽƷߵĿɿ⣻ף12״̬ļ⣬˼򻯷ķȫ״̬״̬תͼнʡ״̬֮״̬תƣĽܱȽϴΪ߷ľȣӦ״̬֮״̬תߣӦĺķֽУ12ʱӦ˵ȫ״̬ĸҪһЩ12ʱȫ״̬ĸҪһЩף13ҲһߵĿɿϸķ.
ĶԴߵ״ۣһغйҲһеĹغԣ֮Ի״̬ĵЧʹܹõָ߽꣬зƺŻ.
2غ
Ϊ˷ķ㣬ȸһЩ裺
1)׼ἢ㹻ԭϣĩ㹻ĳƷ⣻
2)i(i=1,2,,m)ʾ Mi ״̬Цi=1ʾ Mi i=0 ʾ Mi ʧЧni(i=1,2,,m-1)ʾBi йĸôߵ״̬ΪS=(n1,,nm-1,1,m);
3) Mi(i=1,2,m)ļӹʱ䡢ʧЧʱʱֱӲΪ i,i ͦi ֲָi,i,i ֱΪ(service rate)ʧЧ(failure rate) ޸(repair rate).
4)ڴʹݹĹȫɿģֹ.

۵·ģͣͨԤƳߵܣߵƣŻ.
ߵָҪУ̬Ч(efficiency)̬(production rate  throughput)ƽ(average level of buffer).
2.1״̬.
ڶԻ Bi ģʱ Bi ǰлͻһЧĻMu(i)棬Bi 󼶵лͻһЧĻ Md(i).ʱ߶ԻBi Чͼ2ʾ.


ͼ2Ч
ڻʧЧ󣬻ʵʾͻ仯ȶС.u(i)ΪЧ Mu(i)ʣd(i)ΪЧ Md(i)ʣ814ݱ Bi ߵĵЧ Mu(i)ұߵĵЧ Md(i)ıΪ(ӹʧЧ޸)ǳӽֲָԿɽƵΪЧMu(i) Md(i)ļӹʱǷӲΪu(i)ͦd(i)ֲָ.ܹõЧʦu(i)ͦd(i)ͿԶԻΪкܺõ.
 Bi״̬012Ki Ki+1״̬״̬תͼͼ3ʾ.

ͼ3Bi״̬תͼ
д״̬
(1)
ﵽ̬ʱԽ

 ôͿԵõ Bi ȫյĸʺȫĸ
(2)
(3)
ʽӿ Bi ȫյĸʺȫĸֻ i йأԲҪõu(i)ͦd(i)ȷֵֻҪõߵıֵi(i=1,2,,m-1)ɣҲҪm-1δ֪.
2.2غ
 Mi̬Ч Eiָ̬ʱ MiӹĸʣҲָMiڹȲҲĸ.ɱʾΪ
Ei=P(i=1,ni-10,niKi),
Mi̬Ϊ
Pi=iP(i=1,ni-10,niKi),
 Bi йƽ

ڵһ̨ Mi׵õ̬ЧȺ̬.
̬Чȡ
̬ʡ
 m ɴʱͼ󣬻MiʵЧȺʵʽȵĻЧȺСʾΪ
Ei=eiP(ni-10 and niKi),
Pi=ieiP(ni-10 and niKi).
һС¼P(ni-1=0 and ni=Ki).
¼ni-1=0 and ni=Ki״̬ S תƵõģ״̬ S ǣ1)ni-1=1 and ni=Ki-12) Mi-1ʧЧǼ3) Mi i=1;4) Mi+1ʧЧ.Ҳ˵ Mi ӹһ󣬷ڼ״̬Ҵ״̬.һС¼ԽƵرΪ
P(ni-1=0 and ni=Ki)0.
Ȼʦi Ȧi-1ͦi+1ܶʱ¼ΪС¼пһЩ8.ˣ Mi ʵʿԽΪ
Pi֦iei(1-P(ni-1=0)-P(ni=Ki)).(4)
ڴУȲҲ˴ߴﵽ̬ʱغġغ㣬
P1=P2==Pm.(5)
ʽ m-1 ķ.
2.3ܷ
Ի״̬ʱҪ m-1 δ֪غķпԵõ m-1 ̣ǾͿ(2)(3)(4)(5)ɷ飬õi(i=1,2,m-1),ʽ(2)(3)ֵ P(ni=0)P(ni=Ki)(i=1,2m-1).
ǿԵõĵָ̬£
ߵ̬Ч
E=minEiminei(1-P(ni-1=0)-P(ni=Ki))
ߵ̬
P=Pi֦iei(1-P(ni-1=0)-P(ni=Ki))
 Bi йƽ

3ֵ
һߣʡʧЧʺ޸ʵֵ1ʾ K=2,ϵͳ̬ʼЧ.
1Ĳֵ

iii
 M10.0020.013
 M20.0050.022

ܵغԶԻͻ״ֱ̬.
1)
ȫպȫĸ

2)״̬
Եһǰ޼̬Ϊ

Եڶ̬Ϊ

ﵽ̬ʱغ P1=P2,漸ʽӴԵõ

3)ߵܷ
ߵ̬ʡP=P1=P2=1.28
M1 ̬ЧȡE1=0.43
M2̬ЧȡE2=0.64.
4
ĶԿǻʧЧĴߵܽۺͷغ.ɴʱڹҲǿ̬ʱغģҲ˵̬ʱߵ̬ÿ̬ʶͬģ߱е.
ڶԻнģͶԹغзĻϣõߵָ꣺̬Чȣ̬ʺͻйƽ.
в m m-1 ʱ̬ܵȡᵽm-1̵⣬΢Windows Matlab V4.0 Ǻ󵽵.
ַõ̬ʵָ꣬ǾͿԶ߽ƣŻĽ.
1)ȻѧĿ.йƻ(1996).

߼飺̷19621986ҵ廪ѧԶϵ1990йѧԺԶоʿѧλΪйѧԺԶооԱʿʦϵͳѧʵ.ȤУϵͳɿۼӦáϼ⼰ϼϵͳȡ˿ƼɿƵ.
ߵλйѧԺԶо100080
ο
1ݡBuzacott J A.The effect of station breakdown and random processing time on the capacity of flow line with in-process storage.AIIE Transactions,1972,4(4):308-312.
2ݡGershwin S B,Berman O.Analysis of transfer lines consisting of two unreliable machines with random processing times and finite storage buffers.AIIE transactions,1981,13(1):2-11.
3ݡGershwin S B.An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking.Oper.Res.,1987,35(2):291-305.
4ݡDallery Y,David R,Xie X L.An efficient algorithm for analysis of transfer lines with unreliable machines and finite buffers.IIE Transactions,1988,20(3):280-283.
5ݡDallery Y,David R,Xie X L.Approximate analysis of transfer lines with unreliable machines and finite buffrs.IEEE Trans.Auto Contr.,1989,34(9):943-953.
6ݡHong Y.The analysis of a production line with unreliable machines and random processing times.IIE Transactions,1992,24(1):77-83.
7ݡY Choong,Gershwin S B.A decomposition method for the approximate evaluation of capacitated transfer lines with unreliable machines and random processing times.IIE Transactions,1987,19(2):150-159.
8ݡGershwin S B.Manufacturing system engineering.Englewood Cliffs,New Jersey:PTR Prentice Hall,1994.
9ݡKoster D et al.Estimation of line efficiency by aggregation.Int. J.Prod.,1987,25(4):615-626.
10ݡKoster D et al.An Improved Algorithm to Approximate the Behaviour of Flow Lines.Int.J.Prod.Res.,1988,26(4):691-700.
11ݡɹ.л CIMS ɿԵо.Զѧ199218(1)15-22.
12ݡ̷ɹ.CIMS л״̬ɿԷ.Զѧ199420(3)271-277.
13ݡLi Wei.Analysis and scheduling of repairable complex system:Ph.D.dissertation.Beijing:Institute of Applied Mathematics,Chinese Academey of Sciences,China,1993.
14ݡSuri R.Robustness of queueing network formula.J.of ACM,1983,30:564-594. 
ոڡ1996-03-25
