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

Transient and busy period analysis of the GIG/1 Queue as a Hilbert factorization problem

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

DOI10.2307/3214690zbMath0749.60086OpenAlexW2035790788MaRDI QIDQ3988129

Daisuke Nakazato, Hong-Tao Zhang, Dimitris J. Bertsimas, Julian Keilson

Publication date: 28 June 1992

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214690


zbMATH Keywords

Rouché's theorembusy period distributionrenewal arrival processHilbert factorization problem


Mathematics Subject Classification ID

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


Related Items (4)

Explicit Formulae for the Queue Length Distribution of Batch Arrival Systems ⋮ Transient and busy period analysis of the GI/G/1 queue: The method of stages ⋮ Robust transient analysis of multi-server queueing systems and feed-forward networks ⋮ Rare events in queueing systems -- A survey







This page was built for publication: Transient and busy period analysis of the GIG/1 Queue as a Hilbert factorization problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3988129&oldid=12043258"
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 00:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki