SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

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

Clearing Models for M/G/1 Queues · Study

ArticleShelves

ArticleClearing Models for M/G/1 Queues

Onno Boxma2001

Article2001

Clearing Models for M/G/1 Queues

Onno Boxma · David Perry · Wolfgang Stadje

45 citations·0/0 files stored·Queueing Systems

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 Risk Models Age of Information Optimization

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

References

1987Applied Probability and Queues 1983The Single Server Queue 1991Product-form queueing networks with negative and positive customers 1999Introduction to Stochastic Networks 1996A Pollaczek–Khintchine formula forM/G/1 queues with disasters 1977On up- and downcrossings 1992Useful martingales for stochastic storage processes with Lévy input 2013Useful Martingales for Stochastic Storage Processes with Lévy-Type Input

Cited by

2002First-exit times for compound poisson processes for some types of positive and negative jumps 2010Continuous review inventory models for perishable items ordered in batches 2003A STOCHASTIC CLEARING MODEL WITH A BROWNIAN AND A COMPOUND POISSON COMPONENT 2004An EOQ model with state-dependent demand rate 2019Double-sided matching queues: Priority and impatient customers 2010An initiative for a classified bibliography on G-networks

Related works

Explore the map →

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

2003A STOCHASTIC CLEARING MODEL WITH A BROWNIAN AND A COMPOUND POISSON COMPONENTarticle · 8 shared references 2002On a tandem G-network with blockingarticle · 8 shared references 2002First-exit times for compound poisson processes for some types of positive and negative jumpsarticle · 7 shared references 2003G-Networks: Development of the Theory of Multiplicative Networksarticle · 7 shared references 1998An exhaustive lĕvy storage process with intermittent outputarticle · 6 shared references 1996The Workload in the M/G/1 Queue with Work Removalarticle · 5 shared references

Details

Year2001

Typearticle

Published2001-07-01

VenueQueueing Systems

ISSN-L0257-0130

Languageen

Citations45

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.1023/a:1010903605577

openalex_workW2132561464

Links

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

2015

AnMX/G/1 queueing system with disasters and repairs under a multiple adapted vacation policy

2021An M/M/c queue with queueing-time dependent service rates