View in EDS PDF Full Text

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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 192779642
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A STUDY OF QUEUE DYNAMICS IN DISCRETE-TIME N-POLICY SYSTEM WITH CUSTOMER SWITCHING BEHAVIOUR.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22LAXMI%2C+P%2E+VIJAYA%22">LAXMI, P. VIJAYA</searchLink><relatesTo>1</relatesTo><i> vijayalaxmiau@gmail.com</i><br /><searchLink fieldCode="AR" term="%22ANJALIDEVI%2C+G%2E%22">ANJALIDEVI, G.</searchLink><relatesTo>1</relatesTo><i> anjalidevigilaka@gmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Reliability%3A+Theory+%26+Applications%22">Reliability: Theory & Applications</searchLink>. Mar2026, Vol. 21 Issue 1, p344-358. 15p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Queuing+theory%22">Queuing theory</searchLink><br /><searchLink fieldCode="DE" term="%22Matrix+analytic+methods%22">Matrix analytic methods</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+programming%22">Mathematical programming</searchLink><br /><searchLink fieldCode="DE" term="%22Stability+theory%22">Stability theory</searchLink><br /><searchLink fieldCode="DE" term="%22Queueing+networks%22">Queueing networks</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=192779642
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.24412/1932-2321-2026-190-344-358
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 344
    Subjects:
      – SubjectFull: Queuing theory
        Type: general
      – SubjectFull: Matrix analytic methods
        Type: general
      – SubjectFull: Mathematical programming
        Type: general
      – SubjectFull: Stability theory
        Type: general
      – SubjectFull: Queueing networks
        Type: general
    Titles:
      – TitleFull: A STUDY OF QUEUE DYNAMICS IN DISCRETE-TIME N-POLICY SYSTEM WITH CUSTOMER SWITCHING BEHAVIOUR.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: LAXMI, P. VIJAYA
      – PersonEntity:
          Name:
            NameFull: ANJALIDEVI, G.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 19322321
          Numbering:
            – Type: volume
              Value: 21
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Reliability: Theory & Applications
              Type: main
ResultId 1