Integrating a modified simulated annealing algorithm with the simulation of a manufacturing system to optimize buffer sizes in automatic assembly systems

  • Authors:
  • Akif Asil Bulgak;Jerry L. Sanders

  • Affiliations:
  • Department of Industrial Engineering, University of Wisconsin-Madison, 1513 University Ave., Madison, WI;Department of Industrial Engineering, University of Wisconsin-Madison, 1513 University Ave., Madison, WI

  • Venue:
  • WSC '88 Proceedings of the 20th conference on Winter simulation
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

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 individual machines as well as the transport delays that are a part of the material handling system. If the buffer sizes are too large then the transport delays are excessive and more in-process inventories must be loaded into the system to accommodate the large buffer sizes. If the buffer sizes are too small then small processing delays will cause the buffers to fill and upstream workstations will be blocked from releasing completed workpieces. This paper integrates an extension of the simulated annealing algorithm used in combinatorial optimization with a discrete event simulation of the manufacturing system to find optimal buffer sizes for asynchronous assembly systems which involve automated inspection as well as automated assembly.