Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop

Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop

0.00 Avg rating0 Votes
Article ID: iaor1997501
Country: United Kingdom
Volume: 24
Issue: 1
Start Page Number: 73
End Page Number: 81
Publication Date: Feb 1996
Journal: OMEGA
Authors: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.