Analysis of a discrete-time queue with time-limited overtake priority

DOI10.1007/S10479-015-2000-8zbMath1334.90033OpenAlexW1940247132MaRDI QIDQ271924

Herwig Bruneel, Sabine Wittevrongel, Bart Steyaert, Sofian De Clercq

Publication date: 20 April 2016

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

Full work available at URL: https://doi.org/10.1007/s10479-015-2000-8

zbMATH Keywords

probability generating functionpriorityqueueing theorycensored Markov chainsdynamic priorityearliest-due-datepriority jumpsslot-bound priority

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (1)

Delay characteristics in place-reservation queues with class-dependent service times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Delay analysis of a discrete-time multiclass slot-bound priority system
• Rejoinder on: ``Queueing models for the analysis of communication systems
• Performance comparison of several priority schemes with priority jumps
• A multi-class discrete-time queueing system under the FCFS service discipline
• Queue content analysis in a 2-class discrete-time queueing system under the slot-bound priority service rule
• Place reservation: Delay analysis of a novel scheduling mechanism
• A survey on scheduling problems with due windows
• Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• The censored Markov chain and the best augmentation
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Discrete-Time Queuing Theory
• Numerical Methods for Structured Markov Chains

This page was built for publication: Analysis of a discrete-time queue with time-limited overtake priority