Skip to Main Content
The problem of production scheduling of manufacturing systems is characterized by the large number of possible solutions. Several researches have been using the Genetic Algorithms (GA) as a search method to solve this problem since these algorithms have the capacity of globally exploring the search space and find good solutions quickly. Since the performance of the GA is directly related to the choice of the parameters of genetic operators, and a bad choice can depreciate the performance, this paper proposes the use of Adaptive Genetic Algorithm to solve this kind of scheduling problem considering the machines and the Automated Guided Vehicles (AGVs). The aim of this paper is to get a good production reactive schedule in order to achieve a good makespan value in a low response obtaining time. The results of this paper were validated in large scenarios and compared with the results of two other approaches. These results are presented and discussed in this paper.
Date of Conference: 11-14 Oct. 2009