Optimal behavior for the Kumar-Seidman network of switching servers
Erjen Lefeber, Jacobus Rooda
In this paper we consider the two machine switching network introduced by Kumar
and Seidman. We consider the problem of minimizing the weighted average number
of jobs in the system, assuming decreasing costs downstream. Assuming that both
machines have the same period, optimal network behavior has been derived. By
means of an illustrative example it is shown that this optimal network behavior
at first glance can be counterintuitive. In particular this implies that
currently existing ways for controlling these kind of networks do not achieve
optimal network behavior.