MACHINE ALLOCATION PROBLEMS IN MANUFACTURING NETWORKS

In this paper we 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. We show that for the first problem our algorithm generates undominated allocations. Furthermore, the algorithm provides us 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. © 1990.