Note—Some Results on Sojourn Times in Acyclic Jackson Networks

DOI10.1287/MNSC.25.10.1027zbMATH Open0465.90034OpenAlexW1999581885MaRDI QIDQ3917869FDOQ3917869

Authors:

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

zbMATH Keywords

sojourn timesacyclic Jackson networks

Mathematics Subject Classification ID

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

Cited In (10)

• Dependence structure of sojourn times via partition separated ordering
• Further remarks on queueing network theory
• Approximations for the time spent in a dynamic job shop with applications to due-date assignment
• 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
• Measurement and optimization of responsiveness in supply chain networks with queueing structures
• A review of open queueing network models of manufacturing systems
• The time spent in a dynamic job shop
• Maxima of sojourn times in acyclic Jackson queueing networks
• Analysis of a three node queueing network

This page was built for publication: Note—Some Results on Sojourn Times in Acyclic Jackson Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3917869)