A discrete-time queueing system with optional LCFS discipline

DOI10.1007/s10479-012-1097-2zbMath1263.90020OpenAlexW1981017847MaRDI QIDQ1945557

Yanyan Li

Publication date: 8 April 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1097-2

zbMATH Keywords

discrete-timebusy periodsojourn timeLCFS discipline

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (5)

Performance analysis and optimization of a pseudo-fault \(\mathrm{Geo}/\mathrm{Geo}/1\) repairable queueing system with \(N\)-policy, setup time and multiple working vacations ⋮ A discrete-time queue with preferred customers and partial buffer sharing ⋮ A non Markovian retrial queueing system ⋮ A discrete-time system with service control and repairs ⋮ A discrete-time queueing system with server breakdowns and changes in the repair times

Cites Work

• Unnamed Item
• Queues with switchover. -- A review and critique
• Randomly interrupted GI-G-1 queues: Service strategies and stability issues
• The discrete-time \(Geo/Geo/1\) queue with negative customers and disasters
• Analysis of the discrete-time \(GI/\text{Geom}(n)/1/N\) queue
• Waiting time approximation in single-class queueing systems with multiple types of interruptions: modeling congestion at waterways entrances
• Performance comparison of some discrete service time systems
• Simultaneity in discrete-time single server queues with Bernoulli inputs
• Discrete time geo\(/G/1\) queue with multiple adaptive vacations

This page was built for publication: A discrete-time queueing system with optional LCFS discipline