Note—Some Results on Sojourn Times in Acyclic Jackson Networks
From MaRDI portal
Publication:3917869
DOI10.1287/mnsc.25.10.1027zbMath0465.90034OpenAlexW1999581885MaRDI QIDQ3917869
No author found.
Publication date: 1979
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.25.10.1027
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items
Analysis of a three node queueing network ⋮ Further remarks on queueing network theory ⋮ Maxima of sojourn times in acyclic Jackson queueing networks ⋮ Measurement and optimization of responsiveness in supply chain networks with queueing structures ⋮ Dependence structure of sojourn times via partition separated ordering ⋮ Approximations for the time spent in a dynamic job shop with applications to due-date assignment ⋮ A review of open queueing network models of manufacturing systems ⋮ The time spent in a dynamic job shop ⋮ Theory of queuing networks and its applications to the analysis of information-computing systems ⋮ Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking
