A STUDY OF QUEUE DYNAMICS IN DISCRETE-TIME N-POLICY SYSTEM WITH CUSTOMER SWITCHING BEHAVIOUR
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.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.
Fields of Study & Subjects
Advanced Queuing Theory Analysis
Age of Information Optimization
Optimization and Search Problems
Publication details
- Journal / source
- Reliability: Theory & Applications
- Publication date
- 1 January 2026
- Language
- EN