A search method using Genetic Algorithm for production reactive scheduling of manufacturing systems

The problem for scheduling the manufacturing systems production involves the modeling task and the application of a technique to solve it. There are some ways used to model such problem and some search strategies have been applied on the model to find a solution. The solution has to consider performances parameters like makespan or another. However, depending on the size and complexity of the system, the response time becomes critical, mostly when itpsilas necessary a reschedule. Researches aim to use genetic algorithms as a search method to solve the scheduling problem. This work proposes the use of genetic algorithm to solve this problem having as performance criteria the minimum makespan and the response time.