A push-pull queueing system

Anat Kopzon, Gideon Weiss

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a two node multiclass queueing network given by two machines each with two classes. There are two streams of jobs. One stream originates in machine 1, which feeds it for further processing to machine 2, and the other stream moves in the opposite direction. We describe a policy for this system which is stable and which keeps both machines busy at all times. We obtain explicit expressions for its steady-state behavior under M/M/· and under M/G/· assumptions. We also describe a similar M machine system.

Original languageEnglish
Pages (from-to)351-359
Number of pages9
JournalOperations Research Letters
Volume30
Issue number6
DOIs
StatePublished - Dec 2002

Bibliographical note

Funding Information:
Research supported in part by German–Israel GIF Grant I-564-246/06/97.

Keywords

  • Manufacturing
  • Priority scheduling policies
  • Queueing
  • Vacation models

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A push-pull queueing system'. Together they form a unique fingerprint.

Cite this