Busy periods of discrete-time queues using the Lagrange implicit function theorem
Year of publication: |
2021
|
---|---|
Authors: | Brown, Geoffrey W. ; Balakrishnan, Narayanaswamy |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 5, p. 650-654
|
Subject: | Busy periods | Computational methods | Discrete-time queues | Lagrange implicit function theorem | Mathematische Optimierung | Mathematical programming | Warteschlangentheorie | Queueing theory |
-
The Israeli Queue with a general group-joining policy
Perel, Nir, (2022)
-
Analysis od G-queue with unreliable server
Rakhee, (2013)
-
Polynomial optimization : matrix factorization ranks, portfolio selection, and queueing theory
Steenkamp, Andries, (2023)
- More ...
-
Higher order moments of renewal counting processes and Eulerian polynomials
Brown, Geoffrey W., (2008)
-
Morita, Lia H. M., (2021)
-
Mahmood, Tahir, (2021)
- More ...