Busy periods of discrete-time queues using the Lagrange implicit function theorem

DOI10.1016/J.ORL.2021.06.014OpenAlexW3179697346MaRDI QIDQ2060340

Geoffrey W. Brown, Narayanaswamy Balakrishnan

Publication date: 13 December 2021

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

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

zbMATH Keywords

computational methodsdiscrete-time queuesbusy periodsLagrange implicit function theorem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• The single server queue in discrete time‐numerical analysis IV
• Univariate Discrete Distributions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Busy periods of discrete-time queues using the Lagrange implicit function theorem