Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers

16 references·2 citing·35 second hop

FromToDepth

this work references cited by second hop

References

1975Theory, Volume 1, Queueing Systems1,411 cited
1982Poisson Arrivals See Time Averages1,220 cited
1963Introduction to the Theory of Queues.961 cited
1954Priority Assignment in Waiting Line Problems417 cited
1988Queueing-blocking system with two arrival streams and guard channels354 cited
1983Introduction to Queueing Theory (2nd ed.).266 cited
1973Introduction to Queueing Theory254 cited
1964On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service225 cited
1984A Multiple Dispatch Queueing Model of Police Patrol Operations98 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
1980Waiting Time In a Multi-Server Cutoff-Priority Queue, and Its Application to an Urban Ambulance Service70 cited
1989Testing the Validity of a Queueing Model of Police Patrol64 cited
1986An N-Server Cutoff Priority Queue47 cited
1981Comparing Operating Characteristics of Queues in Which Customers Require a Random Number of Servers41 cited

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

1984A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol34 cited

Cited by

2021Dynamic dispatch policies for emergency response with multiple types of vehicles32 cited
2006A Queue‐Length Cutoff Model for a Preemptive Two‐Priority $M/M/1$ System14 cited