Abstract
We present a Markov model to approximate the queueing behavior at the G(t)=G(t)=s(t) + G(t) queue with exhaustive discipline and abandonments. The performance measures of interest are: (1) the average number of customers in queue, (2) the variance of the number of customers in queue, (3) the average number of abandonments and (4) the virtual waiting time distribution of a customer when arriving at an arbitrary moment in time. We use acyclic phase-type distributions to approximate the general interarrival, service and abandonment time distributions. An ecient, iterative algorithm allows the accurate analysis of small- to medium-sized problem instances. The validity and accuracy of the model are assessed using a simulation study.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.