Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

An M/G/c queue in which the number of servers required is random

16 references·3 citing·37 second hop

FromToDepth

this work references cited by second hop

References

1984Matrix-Geometric Solutions to Stochastic Models1,706 cited
1963Introduction to the Theory of Queues.961 cited
1985Matrix-geometric solutions in stochastic models871 cited
1982Approximating a Point Process by a Renewal Process, I: Two Basic Methods544 cited
1972Urban Police Patrol Analysis181 cited
1978Approximations in finite-capacity multi-server queues by Poisson arrivals139 cited
1972Regenerative processes in the theory of queues, with applications to the alternating-priority queue113 cited
1981Approximations for the steady-state probabilities in theM/G/cqueue99 cited
1984A Multiple Dispatch Queueing Model of Police Patrol Operations98 cited
1965Analysis of Mixtures of Wide- and Narrow-Band Traffic93 cited
1978A Patrol Car Allocation Model: Background81 cited
1981Multiple Unit Dispatches in Emergency Services: Models to Estimate System Performance79 cited
1980A Queueing System in Which Customers Require a Random Number of Servers73 cited
1985Algorithms and Approximations for Queueing Systems.52 cited
1979Sizing a Message Store Subject to Blocking Criteria47 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

1984

The Feasibility of One-Officer Patrol in New York City

41 cited

Cited by

1993Scheduling and stability aspects of a general class of parallel processing systems24 cited
1989Blocking of finite source inputs which require simultaneous servers with general think and holding times20 cited
1996Computation and optimization methods for multiresource queues17 cited