Stability of a simple re-entrant line with infinite supply of work - The case of exponential processing times

Gideon Weiss

doi:10.15807/jorsj.47.304

Stability of a simple re-entrant line with infinite supply of work - The case of exponential processing times

Gideon Weiss

Department of Statistics

Research output: Contribution to journal › Article › peer-review

Abstract

We consider a two machine 3 step re-entrant line, with an infinite supply of work. We assume that processing times are exponentially distributed. We show that this system is stable under LBFS priority policy.

Original language	English
Pages (from-to)	304-313
Number of pages	10
Journal	Journal of the Operations Research Society of Japan
Volume	47
Issue number	4
DOIs	https://doi.org/10.15807/jorsj.47.304
State	Published - Dec 2004

Keywords

Manufacturing
Priority scheduling policies
Queue
Stability
Virtual infinite buffers

ASJC Scopus subject areas

General Decision Sciences
Management Science and Operations Research

Access to Document

10.15807/jorsj.47.304

Cite this

@article{ae1b36c160264eafba2f31a090db22cb,

title = "Stability of a simple re-entrant line with infinite supply of work - The case of exponential processing times",

abstract = "We consider a two machine 3 step re-entrant line, with an infinite supply of work. We assume that processing times are exponentially distributed. We show that this system is stable under LBFS priority policy.",

keywords = "Manufacturing, Priority scheduling policies, Queue, Stability, Virtual infinite buffers",

author = "Gideon Weiss",

year = "2004",

month = dec,

doi = "10.15807/jorsj.47.304",

language = "English",

volume = "47",

pages = "304--313",

journal = "Journal of the Operations Research Society of Japan",

issn = "0453-4514",

publisher = "Operations Research Society of Japan",

number = "4",

}

TY - JOUR

T1 - Stability of a simple re-entrant line with infinite supply of work - The case of exponential processing times

AU - Weiss, Gideon

PY - 2004/12

Y1 - 2004/12

N2 - We consider a two machine 3 step re-entrant line, with an infinite supply of work. We assume that processing times are exponentially distributed. We show that this system is stable under LBFS priority policy.

AB - We consider a two machine 3 step re-entrant line, with an infinite supply of work. We assume that processing times are exponentially distributed. We show that this system is stable under LBFS priority policy.

KW - Manufacturing

KW - Priority scheduling policies

KW - Queue

KW - Stability

KW - Virtual infinite buffers

UR - http://www.scopus.com/inward/record.url?scp=13744259035&partnerID=8YFLogxK

U2 - 10.15807/jorsj.47.304

DO - 10.15807/jorsj.47.304

M3 - Article

AN - SCOPUS:13744259035

SN - 0453-4514

VL - 47

SP - 304

EP - 313

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

IS - 4

ER -

Stability of a simple re-entrant line with infinite supply of work - The case of exponential processing times

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this