Buffer size optimization in asynchronous assembly systems using genetic algorithms

Abstract

Selecting appropriate buffer sizes for the transport systems of automated manufacturing systems is a complex task that must account for random fluctuations in production rates by the individual stations as well as for transport delays that are a part of material handling system. If buffer sizes are too large, then transport delays are excessive and more in-process inventories must be input into the system to accommodate the large buffer sizes. If the buffer sizes are too small, then small processing delays will cause the buffer to fill, and upstream workstations will be blocked from releasing complete workpiece. This article presents the buffer size optimization problems of Asynchronous Assembly Systems. Genetic Algorithms (GAs) of Holland are applied to the problem in an attempt to extend their domain of application the complex design optimization problems of a certain class of manufacturing systems. In addition to a detailed description of the buffer size allocation problems, a brief introduction to GAs is given. A number of examples are presented. Also, future research directions are indicated.