Dependence structure of sojourn times via partition separated ordering

DOI10.1016/S0167-6377(03)00054-3zbMath1029.60070MaRDI QIDQ1412712

Ryszard Szekli, Hans Daduna

Publication date: 25 November 2003

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

zbMATH Keywords

AssociationExponential multiserverJoint sojourn time vectorPartition separated orderingPositive upper orthant dependence

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Travel and sojourn times in stochastic networks
• Stochastic ordering and dependence in applied probability
• On the correlation of sojourn times in open networks of exponential multiserver queues
• Waiting Times When Queues are in Tandem
• The amount of overtaking in a network of queues
• Sojourn times in closed queueing networks
• Sojourn times in queuing networks with multiserver modes
• The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
• Positive correlations in a three-node Jackson queueing network
• The Cycle Time Distribution of Exponential Cyclic Queues
• Sojourn times and the overtaking condition in Jacksonian networks
• Note—Some Results on Sojourn Times in Acyclic Jackson Networks
• Sojourn Times in Queueing Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Dependencies in Markovian networks
• The Time for a Round Trip in a Cycle of Exponential Queues
• Conditional job-observer property for multitype closed queueing networks
• The Output of a Queuing System
• Networks of Waiting Lines
• Letter to the Editor—The Dependence of Sojourn Times in Tandem M/M/S Queues
• The Output Process of a Stationary $M/M/s$ Queueing System
• Note on Queues in Tandem

This page was built for publication: Dependence structure of sojourn times via partition separated ordering