Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Fitting the Pht/Mt/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks

16 references·1 citing·46 second hop

FromToDepth

this work references cited by second hop

References

1983The Queueing Network Analyzer1,034 cited
1982Approximating a Point Process by a Renewal Process, I: Two Basic Methods544 cited
2007Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System299 cited
1996Server Staffing to Meet Time-Varying Demand226 cited
2004Modeling Daily Arrivals to a Telephone Call Center209 cited
1972Air-Terminal Queues under Time-Dependent Conditions154 cited
2007A minimal representation of Markov arrival processes and a moments matching method152 cited
1983An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems128 cited
1990Matching moments to phase distributions: nonlinear programming approaches70 cited
1987Approximating nonstationaryPh(t)/M(t)/s/c queueing systems51 cited
2009Transforming Renewal Processes for Simulation of Nonstationary Arrival Processes51 cited
2011Transient Queueing Analysis40 cited
2004The Pht/Pht/∞ Queueing System: Part I—The Single Node37 cited
2016Transient Queueing Analysis28 cited
2002An Exact Solution for an M(t)/M(t)/1 Queue with Time-Dependent Arrivals and Service22 cited

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

1999A sample path analysis of the M t /M t /c queue21 cited

Cited by

2018Specialized and flexible servers subject to the effects of learning and forgetting10 cited