Analysis of a Queue Subject to Discouraged Arrivals, Customer Impatience, and Self-Switching Server Dynamics

This study examines a single-server queue approach that discourages arrivals, accounts for impatient customers, and includes a self-switching server is considered. A queue with a single self-switching server, subjected to discouraged arrivals and customer impatience, is analyzed. Customers arrive at a rate of λ/(n+1), where λ denotes a positive constant and n corresponds to the total number of customers in the system. The server provides service at a rate of µ1 until the size of the system is smaller than K. Once the system size reaches K, the server switches to a faster service rate of µ2. After joining the queue, customers become impatient and abandon the system at a rate of ξ until the server switches to the fast service rate. There is no impatience once the server starts serving at the faster rate. The steady-state probability distribution of this system is determined, and its performance metrics, such as expected wait time and the number of customers likely to join the queue or system, are provided. Numerical illustrations are also included.

Authors

Institutions

Publication Details

Journal
Contemporary Mathematics
Published
2025-04-29
DOI
https://doi.org/10.37256/cm.6320256285
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis of a Queue Subject to Discouraged Arrivals, Customer Impatience, and Self-Switching Server Dynamics

Sumangala Damodaran, C. T. Dora Pravina, P. Kamala, S. Sreelakshmi
Contemporary Mathematics
Advanced Queuing Theory Analysis
article

Analysis of a Queue Subject to Discouraged Arrivals, Customer Impatience, and Self-Switching Server Dynamics

Sumangala Damodaran, C. T. Dora Pravina, P. Kamala, S. Sreelakshmi
article en

Abstract

This study examines a single-server queue approach that discourages arrivals, accounts for impatient customers, and includes a self-switching server is considered. A queue with a single self-switching server, subjected to discouraged arrivals and customer impatience, is analyzed. Customers arrive at a rate of λ/(n+1), where λ denotes a positive constant and n corresponds to the total number of customers in the system. The server provides service at a rate of µ1 until the size of the system is smaller than K. Once the system size reaches K, the server switches to a faster service rate of µ2. After joining the queue, customers become impatient and abandon the system at a rate of ξ until the server switches to the fast service rate. There is no impatience once the server starts serving at the faster rate. The steady-state probability distribution of this system is determined, and its performance metrics, such as expected wait time and the number of customers likely to join the queue or system, are provided. Numerical illustrations are also included.

Contemporary Mathematics
Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology (IN), Krishnadevaraya College of Dental Sciences and Hospital (IN), Visvesvaraya Technological University (IN)
Openalex Percentile: Top 86%
Advanced Queuing Theory Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.