Asymptotic loss of priority scheduling policies in closed re-entrant lines: a computational study

Abstract

In this paper we present an approximate but efficient analytical method to compute the asymptotic loss of buffer priority scheduling policies in closed re-entrant lines. For simple two-station closed re-entrant lines, this enables the verification of Harrison-Wein conjectures and Jin-Ou-Kumar resuts. For multi-station re-entrant lines, this provides an efficient way of comparing different buffer priority scheduling policies. We also use the method to evaluate the effect of high priority jobs in re-entrant lines.