Delay performance in stochastic processing networks with priority service.

DOI10.1016/S0167-6377(03)00021-XzbMath1033.90015MaRDI QIDQ1400351

Philipp Afèche

Publication date: 13 August 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

QueuesMarkovian: routingnetworks: multi-channel priority queuespriority: preemptive-resumeProduction/schedulingsequencing: stochastic

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30)

Related Items (1)

Equilibrium analysis of observable express service with customer choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Priority Queues
• Modeling a Multiprocessor System with Preemptive Priorities
• The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
• An N-Server Cutoff Priority Queue
• Brownian models of open queueing networks with homogeneous customer populations^∗
• Multiprocessor systems with preemptive priorities
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
• Priority Assignment in Waiting Line Problems
• Networks of Waiting Lines

This page was built for publication: Delay performance in stochastic processing networks with priority service.