×

Queueing models for a flexible machining station. I: The diffusion approximation. (English) Zbl 0553.90049

A work station in a flexible manufacturing system (FMS) typically has a set of parallel machines with a general machining-time distribution and a limited local storage. The station is modeled as a G/G/c/N queue. A diffusion process with two boundaries associated with elementary return processes is formulated to approximate the queueing process. Approximate solutions to major performance measures are derived. The model is most suitable for queues where both the interarrival and the service times have a small (not greater than one) squared coefficient of variation.

MSC:

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

Citations:

Zbl 0553.90050
Full Text: DOI

References:

[1] Barash, M. M., Computerized manufacturing systems for discrete products, (Salvendy, G., The handbook of Industrial Engineering (1982), Wiley: Wiley New York) · Zbl 0629.90047
[2] Bharucha-Reid, A. T., Elements of the Theory of Markov Processes and Their Application (1960), McGraw-Hill: McGraw-Hill New York · Zbl 0095.32803
[3] Buzacott, J. A., ‘Optimal’ operating rules for automated manufacturing systems, IEEE Transactions Automatic Control, AC-12, 80-86 (1982)
[4] Buzacott, J. A.; Shanthikumar, J. G., Models for understanding flexible manufacturing systems, AIEE Transaction, 12, 339-350 (1980)
[5] Buzacott, J. A.; Yao, D. D., Flexible manufacturing systems: A review of models, ((1982), Department of Industrial Engineering, University of Toronto: Department of Industrial Engineering, University of Toronto Ontario), WP 82-07
[6] Cosmetatos, G. P., Some approximate equilibrium results for the multiserver queue M/G/r, Operations Research Quartery, 27, 615-620 (1976) · Zbl 0332.60067
[7] Cox, D. R.; Miller, H. D., The Theory of Stochastic Processes (1968), Wiley: Wiley New York · Zbl 0149.12902
[8] Feller, W., Diffusion processes in one dimension, Transactions of the American Mathematical Society, 77, 1-31 (1954) · Zbl 0059.11601
[9] Feller, W., (An introduction to Probability Theory and Its Applications,, Vol. II (1971), Wiley: Wiley New York) · Zbl 0138.10207
[10] Gelenbe, E., On approximate computer system models, Journal of the Association for Computing Machinery, 22, 261-269 (1975) · Zbl 0322.68035
[11] Gelenbe, E.; Mitrani, I., Analysis and Synthesis of Computer Systems (1980), Academic Press: Academic Press London · Zbl 0484.68026
[12] Halachmi, B.; Franta, W. R., A diffusion approximation to the multiserver queue, Management Science, 24, 529-552 (1979) · Zbl 0373.60122
[13] Hokstad, P., Approximations for the M/G/m Queue, Operations Research, 26, 510-523 (1978) · Zbl 0379.60092
[14] Kimura, T., Studies on diffusion approximation for queueing systems, (Doctoral dissertation (1980), Department of Applied Mathematics and Physics, Kyoto University: Department of Applied Mathematics and Physics, Kyoto University Kyoto, Japan)
[15] Kimura, T., Diffusion approximation for an M/G/m queue, Operations Research, 31, 304-321 (1983) · Zbl 0507.90033
[16] Kimura, T.; Ohno, K.; Mine, H., Diffusion approximation for GI/G/1 queueing systems with finite capacity: I-The first overflow time, II- The stationary behavior, Journal of the Operations Research Society of Japan, 22, 301-320 (1979) · Zbl 0421.60088
[17] Kleinrock, L., (Queueing Systems, Vol. II (1976), Wiley: Wiley New York) · Zbl 0361.60082
[18] Newell, G. F., Applications of Queueing Theory (1982), Chapman and Hall: Chapman and Hall London · Zbl 0503.60094
[19] Nozaki, S. A.; Ross, S. M., Approximations in finite-capacity multiserver queues with Poisson arrivals, Journal of Applied Probability, 15, 826-834 (1978) · Zbl 0398.60094
[20] Stecke, K. E., Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems, Management Science, 29, 273-288 (1983) · Zbl 0517.90035
[21] 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
[22] Takahashi, Y., An approximation formula for the mean waiting time of an M/G/c queue, Journal of the Operations Research Society of Japan, 20, 150-163 (1977) · Zbl 0373.60117
[23] Tijms, H. C.; van Hoorn, M. H.; Federgruen, A., Approximations for the steady-state probabilities in the M/G/c queue, Advances in Applied Probability, 13, 186-206 (1981) · Zbl 0446.60079
[24] Whitt, W., Approximating a point process by a renewal process, I: Two basic methods, Operations Research, 30, 125-147 (1982) · Zbl 0481.90025
[25] Whitt, W., Refining diffusion approximations for queues, Operations Research Letters, 1, 165-169 (1982) · Zbl 0538.90025
[26] Whitt, W., The queueing network analyzer, Bell Systems Technical Journal, 62, 2779-2815 (1983)
[27] Whitt, W., “Evaluating approximations for queues, I: Extremal distributions, II (with J.G. Klincewicz): Shape constraints, III: Mixtures of exponential distributions”, to appear in Bell Systems Technical Journal.; Whitt, W., “Evaluating approximations for queues, I: Extremal distributions, II (with J.G. Klincewicz): Shape constraints, III: Mixtures of exponential distributions”, to appear in Bell Systems Technical Journal.
[28] Yao, D. D., Queueing models of flexible manufacturing systems, (Ph.D. dissertation (1983), Department of Industrial Engineering, University of Toronto: Department of Industrial Engineering, University of Toronto Toronto, Ontario) · Zbl 0649.90061
[29] Yao, D. D.; Buzacott, J. A., Modeling a class of flexible manufacturing systems with reversible routing (1983), submitted for publication · Zbl 0633.90025
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.