The optimal configuration and workload allocation problem in flexible manufacturing systems

Abstract. In this article we consider the problem of determining the minimum cost configuration ( umber of machines and pallets) for a flexible manufacturing system with the constraint ofmeeting a prespecified throughput, while simultaneously allocating the total workload among the machines (or groups of machines). Our procedure allows consideration fupper and lower bounds on the workload at each machine group. These bounds arise as a consequence of precedence onstraints among the various operations and/or limitations on the number or combinations ofoperations that can be assigned to a machine because of constraints on tool slots or the space required to store assembly components. Earlier work on problems of this nature assumes that he workload allocation is given. For the single-machine-type problem we develop an efficient implicit enumeration procedure that uses fathoming rules to eliminate dominated configurations, and we present computational results. We discuss how this procedure can be used as a building block in solving the problem with multiple machine types. Key Words: optimal configuration, workload allocation problem, precedence onstraints, closed queueing networks I