Approximations for Markovian multi-class queues with preemptive priorities.

DOI10.1016/j.orl.2003.09.001zbMath1045.90015OpenAlexW2156786326MaRDI QIDQ1426732

Aart van Harten, Andrei Sleptchenko, Matthieu C. van~der Heijden

Publication date: 15 March 2004

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

Full work available at URL: https://doi.org/10.1016/j.orl.2003.09.001

zbMATH Keywords

ApproximationsMulti-channel queuesPreemptive priorities

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)

Related Items

An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking, A sorting based efficient heuristic for pooled repair shop designs, REDUCING COSTS OF SPARE PARTS SUPPLY SYSTEMS VIA STATIC PRIORITIES, Waiting and sojourn times in a multi-server queue with mixed priorities, Designing multi-echelon service parts networks with finite repair capacity, An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities

Cites Work

• Using repair priorities to reduce stock investment in spare part networks
• Analysis of nonpreemptive priority queues with multiple servers and two priority classes
• On Markovian multi-class, multi-server queueing
• The queue GI/M/s with customers of different types or the queue GI/H_m/s
• The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
• Multiprocessor systems with preemptive priorities
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
• Safety Stock versus Safety Time in MRP Controlled Production Systems