This paper considers a buffer allocation problem of flexible manufacturing system composed of several parallel workstations each with both limited input and output buffers, where machine blocking is allowed and two automated guided vehicles are used for input and output material handling. Some interesting properties are derived that are useful for characterizing optimal allocation of buffers for the given FMS model. By using the properties, a solution algorithm is exploited to solve the optimal buffer allocation problem, and a variety of differently-sized decision parameters are numerically tested to show the efficiency of the algorithm. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Kwon, S. T. (2006). On the optimal buffer allocation of an FMS with finite in-process buffers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3982 LNCS, pp. 767–776). Springer Verlag. https://doi.org/10.1007/11751595_81
Mendeley helps you to discover research relevant for your work.