A Finite Multiserver Queueing System with Non-Preemptive Priorities

Author(s)	Dr. Rekha Kumari
Country	India
Abstract	Queueing systems with priority mechanisms are widely used in communication networks, manufacturing systems, hospitals, and computer processing units where different classes of customers require differentiated services. This paper studies a finite multiserver queueing system with non-preemptive priorities. The system consists of multiple parallel servers, finite waiting space, and two classes of customers with different priority levels. Arrivals are assumed to follow Poisson processes and service times are exponentially distributed. The mathematical formulation of the model is developed using continuous-time Markov chains. Important performance measures such as steady-state probabilities, average queue length, waiting time, server utilization, and blocking probability are derived. Numerical illustrations demonstrate the effect of arrival rate and number of servers on system performance. The study shows that non-preemptive priority discipline improves service quality for high-priority customers without interrupting ongoing services.
Keywords	Queuing, Multi-server, Customers, preemptive.
Field	Mathematics
Published In	Volume 5, Issue 6, November-December 2023
Published On	2023-11-29

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research