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 · Study

ArticleShelves

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

Kanwar Sen1993

Article1993

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

Kanwar Sen · J. L. Jain

19 citations·0/0 files stored·Journal of Statistical Planning and Inference

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 Probability and Risk Models

Abstract

No abstract was published for this record.

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 — 19 citations exist upstream.

References

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

Cited by

1993The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach 1993Combinatorial approach to Markovian queueing models 2002Lattice paths combinatorics applied to transient queue length distribution of C2/M/1 queues and busy period analysis of bulk queues C2b/M/1 1994Transient analysis of queues with heterogeneous arrivals 2002Distribution of number served during a busy period of GI/M/1/N queues-lattice path approach

Related works

Explore the map →

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

2004Bi-level control for batch arrival queues with an early startup and un-reliable serverarticle · 5 shared references 2006Optimal NT policies for M/G/1 system with a startup and unreliable serverarticle · 5 shared references 2006An M/G/1 queue under hysteretic vacation policy with an early startup and un-reliable serverarticle · 5 shared references 1989Control Policies for the MX/G/1 Queueing Systemarticle · 4 shared references 2006Optimal control of the N policy M/G/1 queueing system with server breakdowns and general startup timesarticle · 4 shared references 2005On M/G/1 system under NT policies with breakdowns, startup and closedownarticle · 4 shared references

Details

Year1993

Typearticle

Published1993-02-01

VenueJournal of Statistical Planning and Inference

ISSN-L0378-3758

Languageen

Citations19

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.1016/0378-3758(93)90010-4

openalex_workW2047792282

Links

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

2006Lattice path approach for busy period density of M/G/1 queues using C3 Coxian distribution

1995Lattice path counting andM/M/c queueing systems

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