Machine allocation problems in manufacturing networks

In this paper the authors discuss two server (machine) allocation problems that occur in manufacturing networks. The manufacturing network is modelled as an open network of queues. The server allocation problems are solved by means of a marginal analysis scheme. The authors show that for the first problem the present algorithm generates undominated allocations. Furthermore, the algorithm provides them with bounds to check how close the allocation generated is to the optimal allocation. In the second problem the algorithm presented generates optimal allocations within time bounded by a polynomial function in the size of the network.