Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms
We solved the Flexible Job Shop Scheduling Problem (FJSSP) with transportation constraints in order to minimize the makespan by sequencing and assigning machines. A bibliographic review was made in order to guide the methodology to be used. From there, we approached the problem with a genetic algori...
- Autores:
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2019
- Institución:
- Universidad Católica de Pereira
- Repositorio:
- Repositorio Institucional - RIBUC
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.ucp.edu.co:10785/9727
- Acceso en línea:
- https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/168
http://hdl.handle.net/10785/9727
- Palabra clave:
- Rights
- openAccess
- License
- Derechos de autor 2019 Entre Ciencia e Ingeniería
| Summary: | We solved the Flexible Job Shop Scheduling Problem (FJSSP) with transportation constraints in order to minimize the makespan by sequencing and assigning machines. A bibliographic review was made in order to guide the methodology to be used. From there, we approached the problem with a genetic algorithm. We validated its eff ectiveness by comparing the results obtained with diff erent instances proposed in the literature. The results obtained show that the proposed genetic algorithm is efficient in the diff erent classic Job Shop confi gurations tested. The algorithm is able to find very approximate solutions to the best found to date for the Flexible Job Shop Scheduling Problem with transportation constraints. |
|---|