Abstract
The steady state analysis of M^x/G/1 queue with Multiple Adaptive Vacation (MAV), where the customers enter during the server vacations with probability 'p' (0 ≤ p ≤ 1) is considered. The server provides service to all the entering customers with service follows general distribution. Upon the system being found to be empty, the server immediately takes a vacation of random period. When the server returns to system after a vacation, if the queue length is still empty, he avails another vacation and so on until he completes M number of vacations in successions and the server remains idle and starts service when the server finds a customer in the queue. The probability generating function at an arbitrary time epoch is obtained using Supplementary variable technique. Basic system characteristics such as expected value of the length of the queue, busy period, idle time and expected value of the waiting time are obtained. Cost model is presented and algorithm for finding optimum cost is also presented for the proposed model. Numerical illustration is also provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International journal of information and management sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
