AN IMPROVED ALGORITHM FOR OPTIMIZING A CLOSED QUEUING NETWORK MODEL OF A FLEXIBLE MANUFACTURING SYSTEM

Vinod and Solberg (1985) address an optimization problem within the fr amework of a closed queueing network model for a Flexible Manufacturin g System (FMS). The above problem is referred to as the Optimal System Configuration Problem of an FMS. The optimization parameters in the p roblem are the number of machines at each workstation and the total nu mber of jobs circulating in the system. In this paper we suggest a mor e efficient algorithm for the solution of the above-mentioned problem. Our algorithm is of an implicit enumeration nature and derives its ef ficiency from the exploitation of properties of the throughput functio n of a closed queueing network. The efficiency of the algorithm is dem onstrated with the use of extensive computational results.