Note—Computing Time-Dependent Waiting Time Probabilities in M(t)/M/s(t) Queuing Systems

Linda V. Green · João Soares

32 citations0/0 files storedManufacturing & Service Operations Management

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Age of Information Optimization

Abstract

In this note we present algorithms that compute, exactly or approximately, time-dependent waiting time tail probabilities and the time-dependent expected waiting time in M(t)/M/s(t) queuing systems.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 32 citations exist upstream.

References

1977Fundamentals of Queueing Theory.1985Fundamentals of queueing theory (2nd ed.).2001Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands 2007A Survey and Experimental Comparison of Service-Level-Approximation Methods for NonstationaryM(t)/M/s(t)Queueing Systems with Exhaustive Discipline 2002Accounting for time-varying queueing effects in workforce scheduling

Cited by

2009A Time-Dependent Spatial Queueing Model for the Daily Deployment of Airtankers for Forest Fire Control 2010Modeling a Hospital Queueing Network 2014G-RAND: A phase-type approximation for the nonstationary G(t)/G(t)/s(t)+G(t) queue

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.