Queueing models for a flexible machining station. II: The method of Coxian phases. (English) Zbl 0553.90050

Yao, David D. W.; Buzacott, J. A.

Eur. J. Oper. Res. 19, 241-252 (1985).

[For part I see the preceding review.] - A work station of a flexible manufacturing system (FMS) is modeled as a multi-server queue with finite waiting room. The interarrival/service time distributions have squared coefficients of variations not less than 0.5 and are modeled as Coxian laws of two phases. A recursive scheme is developed to calculate the equilibrium queue length distribution. The model, together with the diffusion approximation model of part I, can be used to aid the design of FMS work stations.

MSC:

90B22	Queues and service in operations research
60K25	Queueing theory (aspects of probability theory)

Keywords:

flexible manufacturing system; multi-server queue; finite waiting room; Coxian laws of two phases; equilibrium queue length distribution; diffusion approximation

Citations:

Zbl 0553.90049

References:

[1]	Altiok, T., Approximate analysis of exponential tandem queues with blocking, European Journal of Operational Research, 11, 390-398 (1982) · Zbl 0497.60096
[2]	Altiok, T.; Stidham, S., The allocation of interstage buffer capacities in production lines, IIE Transactions, 15, 292-299 (1983)
[3]	Cox, D. R., A use of complex probabilities in the theory of stochastic processes, (Proceedings of Cambridge Philosophical Society, 51 (1955)), 313-319 · Zbl 0066.37703
[4]	Herzog, U.; Woo, L.; Chandy, K. M., Solution of queueing problems by a recursive technique, IBM Journal of Research and Development, 19, 295-300 (1975) · Zbl 0307.68043
[5]	Keilson, J., Markov Chain Models: Ratity and Exponentiality (1979), Springer: Springer New York · Zbl 0411.60068
[6]	Marie, R. A., An approximate analytical method for general queueing networks, IEEE Transactions of Software Engineering, SE-5, 530-538 (1979) · Zbl 0422.90037
[7]	Marie, R. A., Calculating equilibrium probabilities for ψ \((n)/C_k/1/N\) queue, (Proceedings Performance ’80. Proceedings Performance ’80, Toronto (May 28-30, 1980)), 117-125
[8]	Sauer, C. H.; Chandy, K. M., Approximate analysis of central server models, IBM Journal of Research and Development, 19, 301-313 (1975) · Zbl 0302.68080
[9]	Stewart, W.; Marie, R., A numerical solution for the ψ \((n)/C_k/r/N\) queue, European Journal of Operational Research, 5, 56-68 (1980) · Zbl 0433.60094
[10]	Sunaga, T.; Biswas, S. K.; Nishida, N., An approximation method using continuous models for queueing problems, II: multi-server finite queue, Journal of the Operations Research Society of Japan, 25, 113-127 (1982) · Zbl 0487.60079
[11]	Van Hoorn, M., Algorithms and approximations for queueing systems, (Ph.D. thesis (1983), Vrije Universiteit: Vrije Universiteit Amsterdam) · Zbl 0541.60095
[12]	Whitt, W., Approximating a point process by a renewal process, I: Two basic methods, Operations Research, 30, 125-147 (1982) · Zbl 0481.90025
[13]	Whitt, W., Evaluating approximations for queues, I: Extremal distributions, II (with J.G. Klincewicz): Shape constraints, III: Mixtures of exponential distributions, AT&T Bell Laboratories Technical Journal, 63, 163-175 (1984) · Zbl 0598.90042
[14]	Wolff, R. W., Poisson arrivals see time averages, Operations Research, 30, 223-231 (1982) · Zbl 0489.60096
[15]	Yao, D. D., Queueing models of flexible manufacturing systems, (Ph.D. thesis (1983), University of Toronto: University of Toronto Toronto, Canada) · Zbl 0649.90061