Frame-bound priority scheduling in discrete-time queueing systems

DOI10.3934/JIMO.2011.7.767zbMath1242.60090OpenAlexW2047023963MaRDI QIDQ656439

Koen De Turck, Sofian De Clercq, Herwig Bruneel, Bart Steyaert

Publication date: 18 January 2012

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2011.7.767

zbMATH Keywords

generating functionsingle serverdiscrete time queuematrix analytical approachframe-bound priority

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 (3)

Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation ⋮ Class clustering destroys delay differentiation in priority queues ⋮ Delay analysis of a discrete-timeGI−GI− 1 queue with reservation-based priority scheduling

This page was built for publication: Frame-bound priority scheduling in discrete-time queueing systems