Facility Layout Linked with Scheduling Problem by Genetic Algorithm and Tabu Search

In this paper, we propose a method to solve simultaneously facility layout problem and scheduling problem. About a initial random layout planning, the production scheduling and the transportation scheduling of AGV are obtained by using priority rules. From the obtained transportation scheduling, the critical transportation and the closeness rating are obtained. Facility layout is renewed by the combined procedure of genetic algorithm and tabu search in order to reduce the material handling cost. By using this renewed facility layout, the production scheduling and the transportation scheduling of AGV are also revised until no further improvement is possible.