Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop
The paper applies permutations of six dispatching rules to a two-machine dynamic flow shop operating as a Poisson process. The size of the second queue is later limited to study the effect of limited buffer space. The performance measures examined are mean and maximum flow times, mean tardiness, and the mean absolute lateness. The best permutations for each case are determined statistically.
Year of publication: |
1996
|
---|---|
Authors: | Sarper, H. ; Henry, M. C. |
Published in: |
Omega. - Elsevier, ISSN 0305-0483. - Vol. 24.1996, 1, p. 73-81
|
Publisher: |
Elsevier |
Keywords: | simulation two-machine flow shop limited buffer space |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Combinatorial Evaluation of Six Dispatching Rules in a Dynamic Two-machine Flow Shop
Sarper, H., (1996)
-
Sarper, H., (1995)
-
Estimating the effects of parameter variability on learning curve model predictions
Vigil, D.P., (1994)
- More ...