Abstract
This study examines a multiple-class M/G/1 queue with multiple thresholds. Each class of customer arrives according to an independent Poisson process, and each class has its own threshold. The idle server is reactivated as soon as any one of the thresholds is reached. Both FCFS and non-preemptive priority cases are considered. The Laplace–Stieltjes transform of the waiting time distribution function and the mean waiting time for each class of customers are derived.
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.
