scientific article; zbMATH DE number 1523216

DOI<440::AID-NAV5>3.0.CO;2-W 10.1002/1520-6750(200008)47:5<440::AID-NAV5>3.0.CO;2-WzbMath0973.90023MaRDI QIDQ4511447

Pu Patrick Wang

Publication date: 6 March 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

probability generating functionroot findingsteady-state probabilityshortest queue

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (4)

Some first passage time problems for the shortest queue model ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE

Cites Work

• Unnamed Item
• A matrix-geometric solution of the jockeying problem
• The shorter queue problem: A numerical study using the matrix-geometric solution
• A numerically stable algorithm for two server queue models
• Analysis of the asymmetric shortest queue problem
• TWO QUEUES IN PARALLEL
• Two Similar Queues in Parallel
• The shortest queue model with jockeying
• J.comput. appl. math
• Two queues in parallel
• Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
• Queueing Analysis of a Jockeying Model

This page was built for publication: