A DISTRIBUTED METHODS OF FACILITY LAYOUT ALGORITHMS

摘要

This paper proposes a distributed methods to improve the efficiency of the facility layout algorithms. The parallelism is created by simultaneously computing different total costs, different central points, different closeness weights and different distances at different workstations. The result has proved that this approach significantly decreases the processing time when compare to the uniprocessor facility layout algorithm.