Topic
Fork–join queue
About: Fork–join queue is a research topic. Over the lifetime, 1974 publications have been published within this topic receiving 51348 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, applied probability and queuing in the field of applied probabilistic analysis is discussed. But the authors focus on the application of queueing in the context of road traffic.
Abstract: (1987). Applied Probability and Queues. Journal of the Operational Research Society: Vol. 38, No. 11, pp. 1095-1096.
1,121 citations
1,042 citations
01 Jan 1991
TL;DR: This work generalizes results to the single server queue with the batch arrival process and emphasizes the resulting simplifications of the computational complexity of the algorithmic solution of single server queues with a general Markovian arrival process.
Abstract: The versatile Markovian point process was introduced by M. F. Neuts in 1979. This is a rich class of point processes whichcontains many familiar arrival process as very special cases. Recently, the Batch Markovian Arrival Process, a class of point processes which was subsequently shown to be equivalent to Neuts’ point process, has been studied using a more transparent notation. Recent results in the matrix-analytic approach to queueing theory have substantially reduced the computational complexity of the algorithmic solution of single server queues with a general Markovian arrival process. We generalize these results to the single server queue with the batch arrival process and emphasize the resulting simplifications. Algorithms for the special cases of the PH/G/l and MMPP/G/1 queues are highlighted as these models are receiving renewed attention in the literature and the new algorithms proposed here are simpler than existing ones. In particular, the PH/G/1 queue has additional structure which further enh...
1,038 citations
TL;DR: The equilibrium joint probability distribution of queue lengths is obtained for a broad class of jobshop-like "networks of waiting lines," where the mean arrival rate of customers depends almost arbitrarily upon the number already present, and the mean service rate at each service center depends almost arbitrary upon the queue length there.
Abstract: (This article originally appeared in Management Science, November 1963, Volume 10, Number 1, pp. 131-142, published by The Institute of Management Sciences.)
The equilibrium joint probability distribution of queue lengths is obtained for a broad class of jobshop-like "networks of waiting lines," where the mean arrival rate of customers depends almost arbitrarily upon the number already present, and the mean service rate at each service center depends almost arbitrarily upon the queue length there. This extension of the author's earlier work is motivated by the observation that real production systems are usually subject to influences which make for increased stability by tending, as the amount of work-in-process grows, to reduce the rate at which new work is injected or to increase the rate at which processing takes place.
917 citations
Book•
30 Nov 2002
TL;DR: This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually cataloging and sorting out queues.
Abstract: Preface. 1. Introduction. 2. Observable Queues. 3. Unobservable Queues. 4. Priorities. 5. Reneging and Jockeying. 6. Schedules and Retrials. 7. Competition Among Servers. 8. Service Rate Decisions. Index.
818 citations