A two stage flow line finite inventory bank and stages that can fail on completion of a task is equivalent to a C2/C2/1/N queueing model in which the arrival process is switched off once N customers wait for service. After transformation of the state equations, two alternative solution procedures are developed, one based on the matrix geometric algorithm and the other based on a recursive algorithm. A comparison of the two algorithms shows that there is no difference in the bank size at which numerical instability occurs, but the recursive algorithm is about eight times faster.
No takes yet. Share an insight, caveat, or question.
Buzacott et al. (1987) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: