Abstract
A single-channel queueing model with finite buffer capacity, Poisson arrivals and generally distributed processing times is investigated. According to frequent energy saving requirements, after each busy period the service station is being switched off during a randomly distributed closedown time. Similarly, the first processing in each busy period is preceded by a random setup time, during which the service process is suspended and the machine is being switched on and achieves full readiness for the processing. A system of Volterra-type integral equations for the distribution of the time to the first buffer overflow, conditioned by the initial level of buffer saturation, is built, by applying the idea of embedded Markov chain and continuous version of total probability law. Using the linear algebraic approach, the solution of the corresponding system written for Laplace transforms is obtained explicitly.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ke, J-Ch.: On M/G/1 system under NT policies with breakdowns, startup and closedown. Appl. Math. Model. 30, 49–66 (2006)
Arumuganathan, R., Jeyakumar, S.: Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy policy and closedown times. Appl. Math. Model. 29, 972–986 (2005)
Ke, J-Ch.: Batch arrival queues under vacation policies with server breakdowns and startup/close-down times. Appl. Math. Model. 31, 1282–1292 (2007)
Krishna, G.V., Reddy, R., Nadarajan, R.: Arumuganathan: Analysis of a bulk queue with N-policy multiple vacations and setup times. Comput. Oper. Res. 25, 957–967 (1998)
Moreno, P.: A discrete-time single-server queueing system under multiple vacations and setup-closedown times. Stochast. Anal. Appl. 27, 221–239 (2009)
Artalejo, J.R., Economou, A., Lopez-Herrero, M.J.: Analysis of a multiserver queue with setup times. Queueing Syst. 52, 53–76 (2005)
Kempa, W.M.: The transient analysis of the queue-length distribution in the batch arrival system with N-policy, multiple vacations and setup times. In: Venkov, G., Kovacheva, R., Pasheva, V. (eds.) Applications of Mathematics in Engineering and Economics (AMEE-10), 36th International Conference, 5–10 June 2010, Sozopol, Bulgaria, Melville, American Institute of Physics, (AIP Conference Proceedings, vol. 1293), pp. 235–242 (2010)
Kempa, W.M.: On transient queue-size distribution in the batch arrival system with the N-policy and setup times. Math. Commun. 17, 285–302 (2012)
Kempa, W.M., Paprocka, I.: Analytical solution for time-dependent queue-size behavior in the manufacturing line with finite buffer capacity and machine setup and closedown times. In: Slatineanu, L. et al. (ed.) Selected, Peer Reviewed Papers from the 19th Innovative Manufacturing Engineering 2015 (IManE 2015), May 21–22, 2015, pp. 1360–1365. Iasi, Romania. Zurich, Trans Tech Publications (2015) (Applied Mechanics and Materials, vol. 809/810)
Kempa, W.M., Paprocka, I., Grabowik, C., Kalinowski, K.: Time-dependent solution for the manufacturing line with unreliable machine and batched arrivals. In: Modern Technologies in Industrial Engineering (ModTech2015), 17–20 June 2015. Mamaia, Romania, Bristol, Institute of Physics Publishing (2015), 1–6 (IOP Conference Series, Materials Science and Engineering, vol. 95)
Kempa, W.M.: On transient virtual delay in a finite-buffer queueing model with server breakdowns. In: Information systems architecture and technology. In: Grzech, A. et al. (ed.) Selected Aspects of Communication and Computational Systems, pp. 77–86. Wrocław University of Technology, Wrocław (2014)
Chydziński, A.: Time to buffer overflow in an MMPP queue. In: International Conference NETWORKING 2007: Ad Hoc and Sensor Networks, Wireless Networks Next Generation Internet (Lecture Notes in Computer Science, vol. 4479), pp. 879–889
Kempa, W.M.: On the distribution of the time buffer overflow in a queueing system with a general-type input stream. In: Proceedings of the 35th International Conference on Telecommunications and Signal Processing (TSP-2012), 3–4 July 2012, pp. 207–211. Prague, Czech Republic, IEEE (2012). DOI:10.1109/TSP.2012.6256283)
Korolyuk, V.S.: Boundary-Value Problems for Compound Poisson Processes. Naukova Dumka, Kiev (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kempa, W.M., Paprocka, I. (2017). Time to Buffer Overflow in a Finite-Capacity Queueing Model with Setup and Closedown Times. In: Świątek, J., Wilimowska, Z., Borzemski, L., Grzech, A. (eds) Information Systems Architecture and Technology: Proceedings of 37th International Conference on Information Systems Architecture and Technology – ISAT 2016 – Part III. Advances in Intelligent Systems and Computing, vol 523. Springer, Cham. https://doi.org/10.1007/978-3-319-46589-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-46589-0_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46588-3
Online ISBN: 978-3-319-46589-0
eBook Packages: EngineeringEngineering (R0)