Network optimization prior to dynamic simulation of AMHS

Authors:
Christian Hammel;Thorsten Schmidt;Matthias Schöps
Affiliations:
Technical University Dresden, Dresden, Germany;Technical University Dresden, Dresden, Germany;GLOBALFOUNDRIES Dresden, Dresden, Germany
Venue:
Proceedings of the Winter Simulation Conference
Year:
2012

Citing 3
Cited 0

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The method presented in this paper is based on deducing a network graph from an automated material handling system in order to utilize algorithms from graph theory. An optimization process is built on this network structure enabling an improvement of AMHS system performance prior to employment of dynamic simulations. Run time in a static simulation is significantly shorter than that of dynamic simulations, thus this approach provides improvements not previously achievable. These may then later be analyzed and validated in dynamic simulations. The achievements of this method are demonstrated in a case study of a running semiconductor Fab. The throughput limit of the AMHS was able to be increased by nearly 20% without negative impact on delivery times.