EXPERIMENTS WITH PRIORITY DISPATCHING RULES IN A PARALLEL PROCESSOR SHOP

In general, the performance of the shop was substantially improved by using the priority rules, and some interesting differences were observed.

Abstract

SUMMARY A parallel processor shop was modeled in order to simulate its performance, with respect to certain criteria, when jobs were dispatched to machines by various priority dispatching rules. Several rules which have shown good performance in pure job shop studies, as well as a new weighted objective rule, were tested in the modeled environment. The rules performed much as would have been expected from reviewing job shop literature. However, some interesting differences were observed. In general, the performance of the shop was substantially improved by using the priority rules.