1993
DOI: 10.1007/bf01158930
|View full text |Cite
|
Sign up to set email alerts
|

Re-entrant lines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
96
0

Year Published

1996
1996
2017
2017

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 328 publications
(109 citation statements)
references
References 25 publications
1
96
0
Order By: Relevance
“…The processing times for each of the 3 steps are independent sequences of independent identically distributed random variables, with means m i and rates µ i = 1/m i , i = 1, 2, 3. This system is the simplest example of a re-entrant line (as defined by Kumar [6]), which in turn is a special case of a multi-class queueing network (as described by Harrison [4]). This particular system has previously been studied in [10,3,1].…”
Section: Introductionmentioning
confidence: 99%
“…The processing times for each of the 3 steps are independent sequences of independent identically distributed random variables, with means m i and rates µ i = 1/m i , i = 1, 2, 3. This system is the simplest example of a re-entrant line (as defined by Kumar [6]), which in turn is a special case of a multi-class queueing network (as described by Harrison [4]). This particular system has previously been studied in [10,3,1].…”
Section: Introductionmentioning
confidence: 99%
“…This system is the simplest example of a re-entrant line (as defined by Kumar [10]), which in turn is a special case of a multi-class queueing network (as described by Harrison [8]). This particular system has previously been studied in [3,5,9,14].…”
Section: Introductionmentioning
confidence: 99%
“…Second, we show that such PDO's can be more accurately described by a probabilistic re-entrant line (which is a multiclass queueing network) [27], [28] and such a model can be used in obtaining additional insights into reducing development lead times. The use of probabilistic re-entrant lines makes the models far more realistic than the coarse single class queueing network models and enables subtle, internal scheduling issues to be revealed, motivating the use of fluctuation smoothing scheduling policies [29] and other queueing techniques in achieving lead time reduction.…”
Section: B Objectives and Outlinementioning
confidence: 99%
“…This will be a multiclass QN and in particular can be described as a reentrant line with probabilistic routing. Re-entrant lines [27] are appropriate for modeling queueing systems with distinct multiple job visits to service centers.…”
Section: Re-entrant Line Model Of Company Abcmentioning
confidence: 99%