Abstract
This paper analyzes the synchronization process of an assembly-like queueing system in which two distinct types of items/customers arrive at separate buffers, according to independent Poisson processes, so as to be synchronized into pairs at a synchronization node. Once a pair is synchronized it then queues up for service from a single server on a first-in-first-out basis as pairs. It is assumed that the service times of pairs are exponentially distributed and that the system has infinite capacity. Despite their practical significance, such queueing systems have not been adequately treated in the literature due to their transience or null recurrence. We first investigate the transient and asymptotic properties of the synchronization process’ first two moments, both analytically and numerically. Motivated by the observed asymptotic behavior, we then propose an M/M/1 approximation to describe the behavior of such assembly-like queueing systems. Finally, a numerical study of the proposed approximation reveals that it performs sufficiently well for practical applications.
Similar content being viewed by others
References
Abramowitz, M., & Stegun, I. A. (1964). US national bureau of standards, applied mathematics series : Vol. 55. Handbook of mathematical functions with formulas, graphs, and mathematical tables. New York: Dover.
Asmussen, S. (2000). Applied probability and queues (2nd ed.). New York: Springer.
Baccelli, F., & Makowski, A. M. (1989). Queueing models for systems with synchronization constraints. Proceedings of the IEEE, 77(1), 138–161.
Bhat, U. N. (1986). Finite capacity assembly-like queues. Queueing Systems, 1(1), 85–101.
Bonomi, F. (1987). An approximate analysis for a class of assembly-like queues. Queueing Systems, 1(3), 289–309.
Burke, P. (1956). The output of a queuing system. Operations Research, 4(5), 699–704.
Duenyas, I., & Hopp, W. J. (1993). Estimating the throughput of an exponential CONWIP assembly system. Queueing Systems, 14(1–2), 137–157.
Foster, F. G. (1959). A unified theory of stock, storage and queue control. Operational Research Quarterly, 10(3), 121–130.
Fukuda, A., Sato, S., & Mukumoto, K. (1988). Parallel queues with common service process and their input control. Electronics and Communications in Japan, Part 1: Communications, 71(4), 1–14.
Harrison, J. M. (1973). Assembly-like queues. Journal of Applied Probability, 10(2), 354–367.
Hopp, W. J., & Simon, J. T. (1989). Bounds and heuristics for assembly-like queues. Queueing Systems, 4(2), 137–155.
Kashyap, B. R. K. (1966). The double-ended queue with bulk service and limited waiting space. Operations Research, 14(5), 822–834.
Keblis, M. F., & Duenyas, I. (1999). Control of an assembly system with processing time and subassembly-type uncertainty. Queueing Systems, 11(4), 353–370.
Kendall, D. G. (1951). Some problems in the theory of queues. Journal of the Royal Statistical Society, Series B, 13(2), 151–185.
Lipper, E. H., & Sengupta, B. (1986). Assembly-like queues with finite capacity: bounds, asymptotics and approximations. Queueing Systems, 1(1), 67–83.
Prabhakar, B., Bambos, N., & Mountford, T. S. (2000). The synchronization of Poisson processes and queueing networks with service and synchronization nodes. Advances in Applied Probability, 32(3), 824–843.
Sasieni, M. W. (1961). Double queues and impatient customers with and application to inventory theory. Operations Research, 9(6), 771–781.
Som, P., Wilhelm, W. E., & Disney, R. L. (1994). Kitting process in a stochastic assembly system. Queueing Systems, 17(3–4), 471–490.
Takahashi, M., Ōsawa, H., & Fujisawa, T. (2000). On a synchronization queue with two finite buffers. Queueing Systems, 36(1–3), 107–123.
Author information
Authors and Affiliations
Corresponding author
Additional information
T. Kimura is supported in part by the Japan Society for the Promotion of Science under Grant 20241037.
Rights and permissions
About this article
Cite this article
Alexander, D.R., Premachandra, I.M. & Kimura, T. Transient and asymptotic behavior of synchronization processes in assembly-like queues. Ann Oper Res 181, 641–659 (2010). https://doi.org/10.1007/s10479-010-0796-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0796-9