Infeasibility handling in genetic algorithm using nested domains for production planning
In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained proble...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2010
|
| Texto completo: | https://hdl.handle.net/10216/92609 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/92609 |