A STUDY OF QUEUE DYNAMICS IN DISCRETE-TIME N-POLICY SYSTEM WITH CUSTOMER SWITCHING BEHAVIOUR.

Saved in:
Bibliographic Details
Title: A STUDY OF QUEUE DYNAMICS IN DISCRETE-TIME N-POLICY SYSTEM WITH CUSTOMER SWITCHING BEHAVIOUR.
Authors: LAXMI, P. VIJAYA1 vijayalaxmiau@gmail.com, ANJALIDEVI, G.1 anjalidevigilaka@gmail.com
Source: Reliability: Theory & Applications. Mar2026, Vol. 21 Issue 1, p344-358. 15p.
Subjects: Queuing theory, Matrix analytic methods, Mathematical programming, Stability theory, Queueing networks
Abstract: This paper investigates a discrete-time queueing system with two parallel servers operating under an N-policy framework and allowing jockeying behaviour. In this model, customers may switch between queues to reduce their waiting time. Upon arrival, a customer typically joins the shorter queue; if both queues have the same length, the choice is made randomly. After joining a queue, customers may still switch if they perceive a faster service opportunity. We analyse the steady-state behaviour of the system using the matrix-geometric method. In addition, we derive the necessary and sufficient condition for system stability, obtain several key performance measures, and formulate a corresponding cost optimisation problem. Numerical experiments, supported by graphical and tabular results, demonstrate the effectiveness and practicality of the proposed analysis. [ABSTRACT FROM AUTHOR]
Copyright of Reliability: Theory & Applications is the property of International Group on Reliability and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This paper investigates a discrete-time queueing system with two parallel servers operating under an N-policy framework and allowing jockeying behaviour. In this model, customers may switch between queues to reduce their waiting time. Upon arrival, a customer typically joins the shorter queue; if both queues have the same length, the choice is made randomly. After joining a queue, customers may still switch if they perceive a faster service opportunity. We analyse the steady-state behaviour of the system using the matrix-geometric method. In addition, we derive the necessary and sufficient condition for system stability, obtain several key performance measures, and formulate a corresponding cost optimisation problem. Numerical experiments, supported by graphical and tabular results, demonstrate the effectiveness and practicality of the proposed analysis. [ABSTRACT FROM AUTHOR]
ISSN:19322321
DOI:10.24412/1932-2321-2026-190-344-358