Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy

Ivo Adan, Gideon Weiss

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a two machine 3 step re-entrant line, with an infinite supply of work. The service discipline is last buffer first served. Processing times are independent exponentially distributed. We analyze this system, obtaining steady state behavior and sample path properties.

Original languageEnglish
Pages (from-to)169-183
Number of pages15
JournalQueueing Systems
Volume54
Issue number3
DOIs
StatePublished - Nov 2006

Bibliographical note

Funding Information:
G. Weiss: Research supported in part by Israel Science Foundation Grant 249/02.

Funding Information:
I. Adan and G. Weiss: Research supported in part by Network of Excellence Euro-NGI.

Keywords

  • GI/M/1 queue
  • Infinite virtual buffers
  • Last buffer first served discipline
  • Manufacturing
  • Markovian multiclass queueing networks
  • Priority scheduling
  • Queueing
  • Sample path properties
  • Steady state distributions

ASJC Scopus subject areas

  • Statistics and Probability
  • Computer Science Applications
  • Management Science and Operations Research
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy'. Together they form a unique fingerprint.

Cite this