Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Lattice path approach to transient solution of M/M/1 with (0,k) control policy

8 references·8 citing·31 second hop

FromToDepth

this work references cited by second hop

References

1985Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations621 cited
1963Queueing Systems with a Removable Service Station455 cited
1968Optimal Operating Policies for M / G /1 Queuing Systems339 cited
1971Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server154 cited
1992A poisson input queue under N-policy and with a general start up time94 cited
1956An Elementary Method of Solution of the Queueing Problem with a Single Server and Constant Parameters73 cited
1989A sample path analysis of theM/M/1 queue68 cited
1972On queues involving batches30 cited

Cited by

1993The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach18 cited
1993Combinatorial approach to Markovian queueing models17 cited
2002Lattice paths combinatorics applied to transient queue length distribution of C2/M/1 queues and busy period analysis of bulk queues C2b/M/112 cited
1994Transient analysis of queues with heterogeneous arrivals11 cited
2002Distribution of number served during a busy period of GI/M/1/N queues-lattice path approach11 cited
2006Lattice path approach for busy period density of M/G/1 queues using C3 Coxian distribution

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

10 cited

1995Lattice path counting andM/M/c queueing systems10 cited

2002Lattice path approach to transient analysis of M/G/1/N non-Markovian queues using Cox distributions9 cited