A queueing system with probabilistic joining strategy for priority customers

DOI10.1007/978-3-030-72247-0_25zbMath1470.60245OpenAlexW3143459672MaRDI QIDQ1980543

Dhanya Babu, A. Krishnamoorthy, V. C. Joshua

Publication date: 8 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72247-0_25

zbMATH Keywords

marked Markovian arrival processjoining strategytokennet benefits

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

\((N, n)\)-preemptive-priority M/G/1 queues with finite and infinite buffers

Cites Work

• Unnamed Item
• \(MMAP|M|N\) queueing system with impatient heterogeneous customers as a model of a contact center
• Two parallel finite queues with simultaneous services and Markovian arrivals
• Queues with postponed work
• A Token Based Parallel Processing Queueing System with Priority
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE
• A Retrial Queueing System with Orbital Search of Customers Lost from an Offer Zone
• Queuing with Preemptive Priorities or with Breakdown

This page was built for publication: A queueing system with probabilistic joining strategy for priority customers