Branching-type polling systems with large setups. (English) Zbl 1231.90144
Summary: The present paper considers the class of polling systems that allow a multi-type branching process interpretation. This class contains the classical exhaustive and gated policies as special cases. We present an exact asymptotic analysis of the delay distribution in such systems, when the setup times tend to infinity. The motivation to study these setup time asymptotics in polling systems is based on the specific application area of base-stock policies in inventory control. Our analysis provides new and more general insights into the behavior of polling systems with large setup times.
MSC:
| 90B22 | Queues and service in operations research |
| 60K25 | Queueing theory (aspects of probability theory) |
Keywords:
polling systems; multi-type branching processes; setup times; delay distribution; asymptoticsReferences:
| [1] | Borst SC, Boxma OJ (1997) Polling models with and without switchover times. Oper Res 45(4): 536–543 · Zbl 0887.90072 · doi:10.1287/opre.45.4.536 |
| [2] | Boxma OJ, Levy H, Yechiali U (1992) Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Ann Oper Res 35: 187–208 · Zbl 0755.60076 · doi:10.1007/BF02188704 |
| [3] | Cohen JW (1969) The single server queue. North-Holland, Amsterdam · Zbl 0183.49204 |
| [4] | Federgruen A, Katalan Z (1996) The stochastic economic lot scheduling problem: cyclical base-stock policies with idle times. Manage Sci 42: 783–796 · Zbl 0880.90031 · doi:10.1287/mnsc.42.6.783 |
| [5] | Federgruen A, Katalan Z (1998) Determining production schedules under base-stock policies in single facility multi-item production systems. Oper Res 46: 883–898 · Zbl 0987.90029 · doi:10.1287/opre.46.6.883 |
| [6] | Fuhrmann SW (1981) Performance analysis of a class of cyclic schedules. Bell Laboratories Technical Memorandum 81-59531-1 |
| [7] | Johnson MA (1993) An empirical study of queueing approximations based on phase-type distributions. Stoch Models 9(4): 531–561 · Zbl 0780.60092 · doi:10.1080/15326349308807280 |
| [8] | Keilson J, Servi LD (1990) The distributional form of Little’s law and the Fuhrmann–Cooper decomposition. Oper Res Lett 9(4): 239–247 · Zbl 0717.60110 · doi:10.1016/0167-6377(90)90068-G |
| [9] | Levy H (1988) Optimization of polling systems: the fractional exhaustive service method. Report, Tel-Aviv University |
| [10] | Levy H (1989) Analysis of cyclic polling systems with binomial gated service. In: Hasegawa T, Takagi H, Takahashi Y (eds) Performance of distributed and parallel systems. North-Holland, Amsterdam, pp 127–139 |
| [11] | Levy H, Sidi M (1990) Polling systems: applications, modeling and optimization. IEEE Trans. Commun. COM-38(10): 1750–1760 · doi:10.1109/26.61446 |
| [12] | Mack C, Murphy T, Webb NL (1957) The efficiency of N machines uni-directionally patrolled by one operative when walking time and repair times are constants. J R Stat Soc Ser B 19(1): 166–172 · Zbl 0090.35301 |
| [13] | Mack C (1957) The efficiency of N machines uni-directionally patrolled by one operative when walking time is constant and repair times are variable. J R Stat Soc Ser B 19(1): 173–178 · Zbl 0090.35302 |
| [14] | Marie RA (1980) Calculating equilibrium probabilities for {\(\lambda\)}(n)/C k /1/N queue. In: Proceedings Performance’80, Toronto, pp 117–125 |
| [15] | Olsen T (2001) Limit theorems for polling models with increasing setups. Probab Eng Inform Sci 15: 35–55 · Zbl 1087.90507 · doi:10.1017/S026996480115103X |
| [16] | Papoulis A (1984) Probability, random variables, and stochastic processes, 2nd edn. McGraw-Hill, New York · Zbl 0558.60001 |
| [17] | Resing JAC (1993) Polling systems and multitype branching processes. Queueing Syst 13: 409–426 · Zbl 0772.60069 · doi:10.1007/BF01149263 |
| [18] | Takagi H (1990) Queueing analysis of polling models: an update. In: Takagi H (eds) Stochastic analysis of computer and communication systems. North-Holland, Amsterdam, pp 267–318 |
| [19] | Takagi H (1997) Queueing analysis of polling models: progress in 1990–1994. In: Dshalalow JH (eds) Frontiers in queueing: models, methods and problems. CRC Press, Boca Raton, pp 119–146 · Zbl 0871.60077 |
| [20] | Takagi H (2000) Analysis and application of polling models. In: Haring G, Lindemann C, Reiser M (eds) Performance evaluation: origins and directions Lecture notes in computer science, vol 1769. Springer, Berlin, pp 423–442 |
| [21] | Tijms HC (1994) Stochastic models: an algorithmic approach. Wiley, Chichester · Zbl 0838.60075 |
| [22] | van der Mei RD (1999) Delay in polling systems with large switch-over times. J Appl Probab 36: 232–243 · Zbl 0955.60095 · doi:10.1239/jap/1032374244 |
| [23] | van der Mei RD (2006) Towards a unifying theory on branching-type polling models in heavy traffic. Report, Vrije Universiteit |
| [24] | van Vuuren M, Winands EMM (2007) Iterative approximation of k-limited polling systems. Queueing Syst 55(3): 161–178 · Zbl 1122.60083 · doi:10.1007/s11134-007-9010-4 |
| [25] | Vishnevskii VM, Semenova OV (2006) Mathematical methods to study the polling systems. Autom Remote Control 67: 173–220 · Zbl 1126.60321 · doi:10.1134/S0005117906020019 |
| [26] | Winands EMM, Adan IJBF, van Houtum GJ (2005) The stochastic economic lot scheduling problem: a survey. (BETA WP-133, Beta Research School for Operations Management and Logistics, Eindhoven) |
| [27] | Winands EMM, Adan IJBF, van Houtum GJ (2006) Mean value analysis for polling systems. Queueing Syst 54(1): 45–54 · Zbl 1137.90434 · doi:10.1007/s11134-006-7898-8 |
| [28] | Winands EMM (2007) On polling systems with large setups. Oper Res Lett 35(5): 584–590 · Zbl 1149.90044 · doi:10.1016/j.orl.2006.10.004 |
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.
