Abstract
In this paper, we introduce the multiple adaptive vacation policy and the general decrementing service rule based on the classical M/G/1 queueing systems, and obtain the P.G.F. (Probability Generating Function) of stationary queue length by using the embedded Markov chain method and regeneration cycle approach. Then, the LST (Laplace Stieltjes Transform) of stationary waiting time is also derived according to the independence between the waiting time and arrival process. At last some special cases are given to show the general properties of the new model, and some numerical results are shown to compare the mean queue length and waiting time of special cases.
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 callDisclaimer: 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.
