Resumo (PT):
In this paper we present a novel genetic algorithm-based approach to tackle a lot-sizing and scheduling problem. Mathematical models, commonly used to represent these problems, have the planning horizon divided in periods and sub-periods. Adjusting the right number of sub-periods becomes a hard task, since higher values create flexible environments and smaller values reduce the problem size and problem complexity. The key idea of our method is to take some advantages about
adjusting the number of sub-periods. In this way, a genetic algorithm which allows for the use of individuals with different size was developed. This feature was performed to maintain the
flexibility, as well as, reducing the computational load. Preliminary results show the benefits obtained when
variable number of sub-periods is used, nevertheless, the tightness of the lower bounds becomes more promising when the number of products increases. More studies are necessary to determine an ideal lower bound rule.
Language:
English
Type (Professor's evaluation):
Scientific