A discrete-time queueing system with optional LCFS discipline

We consider a discrete-time queueing system in which the arriving customers decide with a certain probability to be served under a LCFS-PR discipline and with complementary probability to join the queue. The arrivals are assumed to be geometrical and the service times are arbitrarily distributed. Th...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2013, Vol.202 (1), p.3-17
Main Authors: Atencia, I., Pechinkin, A. V.
Format: Article
Language:English
Subjects:
Applied mathematics
Arrivals
Business and Management
Combinatorics
Customer services
Customers
File servers
Low cycle fatigue
Markov analysis
Mathematical models
Operations research
Operations Research/Decision Theory
Patient safety
Probability
Properties
Queues
Queuing theory
Recursive
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a discrete-time queueing system in which the arriving customers decide with a certain probability to be served under a LCFS-PR discipline and with complementary probability to join the queue. The arrivals are assumed to be geometrical and the service times are arbitrarily distributed. The service times of the expelled customers are independent of their previous ones. We carry out an extensive analysis of the system developing recursive formulae and generating functions for the steady-state distribution of the number of customers in the system and obtaining also recursive formulae and generating functions for the stationary distribution of the busy period and sojourn time as well as some performance measures.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-012-1097-2