Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A numerically stable algorithm for two server queue models

From MaRDI portal
Publication:804099
Jump to:navigation, search

DOI10.1007/BF02412241zbMath0726.60095MaRDI QIDQ804099

Winfried K. Grassmann, Yiqiang Q. Zhao

Publication date: 1991

Published in: Queueing Systems (Search for Journal in Brave)


zbMATH Keywords

numerical examplesparallel queuesjoint distribution of the queue lengths


Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items (4)

A level-crossing approach to the solution of the shortest-queue problem ⋮ Unnamed Item ⋮ Algorithms of distributed task allocation for cooperative agents ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The shorter queue problem: A numerical study using the matrix-geometric solution
  • Ein Wartesystem mit zwei parallelen Warteschlangen
  • TWO QUEUES IN PARALLEL
  • Two Similar Queues in Parallel
  • The autostrada queueing problem
  • The shortest queue problem
  • On Jockeying in Queues


This page was built for publication: A numerically stable algorithm for two server queue models

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:804099&oldid=12742500"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki