ProgramsView all programs
From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Journal Article
Publisher : Applied Mathematical Modelling
Source : Applied Mathematical Modelling, Volume 29, Number 10, p.972-986 (2005)
Campus : Coimbatore
School : School of Engineering
Department : Computer Science
Year : 2005
Abstract : In this paper a MX/G (a, b)/1 queueing system with multiple vacations, setup time with N-policy and closedown times is considered. On completion of a service, if the queue length is ξ, where ξ lt; a, then the server performs closedown work. Following closedown the server leaves for multiple vacations of random length irrespective of queue length. When the server returns from a vacation and if the queue length is still less than 'N', he leaves for another vacation and so on, until he finds 'N' (N gt; b) customers in the queue. That is, if the server finds at least 'N' customers waiting for service, then he requires a setup time 'R' to start the service. After the setup he serves a batch of 'b' customers, where b ≥ a. Various characteristics of the queueing system and a cost model with the numerical solution for a particular case of the model are presented. © 2005 Elsevier Inc. All rights reserved.
Cite this Research Publication : Ra Arumuganathan and Jeyakumar, Sb, “Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy and closedown times”, Applied Mathematical Modelling, vol. 29, pp. 972-986, 2005.