An allocation problem in a certain class of flexible manufacturing systems

The paper studies the optimal allocation of machines and pallets in a class of manufacturing systems. The FMS is modeled as a closed queueing network with balanced loading of the stations. An Algorithm is developed, which exploits the properties of the throughput function and solves the allocation problem for increasing concave profit and convex cost. The paper also studies the more general case of allocating machines and pallets among a set of FMSs. A dynamic programming approach is developed, which solves the problem with O(M³N²) operations.