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
| id |
RepoRIBUC2_d1924762c1efa318a26a878a6268a590 |
|---|---|
| oai_identifier_str |
oai:repositorio.ucp.edu.co:10785/9727 |
| network_acronym_str |
RepoRIBUC2 |
| network_name_str |
Repositorio Institucional - RIBUC |
| repository_id_str |
|
| dc.title.eng.fl_str_mv |
Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms |
| dc.title.spa.fl_str_mv |
Optimización del makespan en el problema de Job Shop Flexible con restricciones de transporte usando Algoritmos Genéticos |
| dc.title.por.fl_str_mv |
Otimização da Makespan no problema fl exível da Job Shop com restrição de transporte usando Algoritmos Genéticos |
| title |
Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms |
| spellingShingle |
Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms |
| title_short |
Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms |
| title_full |
Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms |
| title_fullStr |
Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms |
| title_full_unstemmed |
Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms |
| title_sort |
Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic Algorithms |
| description |
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. |
| publishDate |
2019 |
| dc.date.issued.none.fl_str_mv |
2019-05-30 |
| dc.date.accessioned.none.fl_str_mv |
2022-06-01T19:08:21Z |
| dc.date.available.none.fl_str_mv |
2022-06-01T19:08:21Z |
| dc.type.spa.fl_str_mv |
Artículo de revista |
| dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_2df8fbb1 |
| dc.type.coar.none.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 |
| dc.type.coarversion.none.fl_str_mv |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
| dc.type.driver.none.fl_str_mv |
info:eu-repo/semantics/article |
| dc.type.version.none.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| format |
http://purl.org/coar/resource_type/c_6501 |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/168 10.31908/19098367.3820 |
| dc.identifier.uri.none.fl_str_mv |
http://hdl.handle.net/10785/9727 |
| url |
https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/168 http://hdl.handle.net/10785/9727 |
| identifier_str_mv |
10.31908/19098367.3820 |
| dc.language.none.fl_str_mv |
spa |
| language |
spa |
| dc.relation.none.fl_str_mv |
https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/168/165 https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/168/1174 |
| dc.rights.spa.fl_str_mv |
Derechos de autor 2019 Entre Ciencia e Ingeniería https://creativecommons.org/licenses/by-nc/4.0/deed.es_ES |
| dc.rights.uri.spa.fl_str_mv |
https://creativecommons.org/licenses/by-nc/4.0/deed.es_ES |
| dc.rights.accessrights.spa.fl_str_mv |
info:eu-repo/semantics/openAccess |
| dc.rights.coar.spa.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
| rights_invalid_str_mv |
Derechos de autor 2019 Entre Ciencia e Ingeniería https://creativecommons.org/licenses/by-nc/4.0/deed.es_ES http://purl.org/coar/access_right/c_abf2 |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf application/xml |
| dc.publisher.spa.fl_str_mv |
Universidad Católica de Pereira |
| dc.source.eng.fl_str_mv |
Entre ciencia e ingeniería; Vol 12 No 24 (2018); 105-115 |
| dc.source.spa.fl_str_mv |
Entre Ciencia e Ingeniería; Vol. 12 Núm. 24 (2018); 105-115 |
| dc.source.por.fl_str_mv |
Entre ciencia e ingeniería; v. 12 n. 24 (2018); 105-115 |
| dc.source.none.fl_str_mv |
2539-4169 1909-8367 |
| institution |
Universidad Católica de Pereira |
| repository.name.fl_str_mv |
Repositorio Institucional de la Universidad Católica de Pereira - RIBUC |
| repository.mail.fl_str_mv |
bdigital@metabiblioteca.com |
| _version_ |
1828143520100122624 |
| spelling |
2022-06-01T19:08:21Z2022-06-01T19:08:21Z2019-05-30https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/16810.31908/19098367.3820http://hdl.handle.net/10785/9727We 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.En el presente artículo se aborda el problema Flexible Job Shop Scheduling (FJSSP) con restricciones de transporte, con el objetivo de minimizar el makespan realizando la secuenciación y asignación de máquinas. Se llevó a cabo una revisión bibliográfica para orientar la metodología a utilizar, y a partir de allí, se decidió abordar el problema con un algoritmo genético, validando su efectividad a través de la comparación de los resultados obtenidos con distintas instancias propuestas en la literatura. Los resultados obtenidos muestran que el algoritmo genético propuesto es eficiente en las diferentes configuraciones del Job Shop clásico probadas, y para el Job Shop flexible con restricciones de transportes se presentan soluciones muy aproximadas a las mejores encontradas hasta el día de hoy. Resolvemos o Problema de Agendamento de Ofi cina de Trabalho Flexível (FJSSP) com restrições de transporte para minimizar o makespan por sequenciamento e atribuição de máquinas. Uma revisão bibliográfi ca foi realizada para orientar a metodologia a ser utilizada. A partir daí, abordamos o problema com um algoritmo genético. Nós validamos sua efi cácia comparando os resultados obtidos com diferentes instâncias propostas na literatura. Os resultados obtidos mostram que o algoritmo genético proposto é efi ciente nas diferentes confi gurações clássicas de Job Shop testadas. O algoritmo é capaz de encontrar soluções muito aproximadas Entre Ciencia e Ingeniería, vol. 12, no. 24, julio-diciembre de 2018, página 105 - 115 DOI: http://dx.doi.org/10.31908/19098367.3820ISSN 1909-8367 (Impreso), ISSN 2539-4169 (En línea) Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) 106para o melhor encontrado até o momento para o Problema de Agendamento de Oficina de Trabalho Flexível com restrições de transporte.application/pdfapplication/xmlspaUniversidad Católica de Pereirahttps://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/168/165https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/168/1174Derechos de autor 2019 Entre Ciencia e Ingenieríahttps://creativecommons.org/licenses/by-nc/4.0/deed.es_EShttps://creativecommons.org/licenses/by-nc/4.0/deed.es_ESinfo:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Entre ciencia e ingeniería; Vol 12 No 24 (2018); 105-115Entre Ciencia e Ingeniería; Vol. 12 Núm. 24 (2018); 105-115Entre ciencia e ingeniería; v. 12 n. 24 (2018); 105-1152539-41691909-8367Makespan optimization in the fl exible Job Shop problem with transportation constraints using Genetic AlgorithmsOptimización del makespan en el problema de Job Shop Flexible con restricciones de transporte usando Algoritmos GenéticosOtimização da Makespan no problema fl exível da Job Shop com restrição de transporte usando Algoritmos GenéticosArtículo de revistahttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionCastillo Jaimes, Tatiana AndreaDíaz Bohórquez, Carlos EduardoGómez Moreno, Juan DavidOrduz Gonzáles, Edwin AlfredoNiño Lopez, Myriam LeonorPublication10785/9727oai:repositorio.ucp.edu.co:10785/97272025-01-27 18:59:33.358https://creativecommons.org/licenses/by-nc/4.0/deed.es_ESDerechos de autor 2019 Entre Ciencia e Ingenieríametadata.onlyhttps://repositorio.ucp.edu.coRepositorio Institucional de la Universidad Católica de Pereira - RIBUCbdigital@metabiblioteca.com |