A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2023 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10400.14/43148 |
Resumo: | Flexible job shop scheduling has received considerable attention due to its extensive applications in manufacturing. High-quality scheduling solutions are desired but hard to be guaranteed due to the NP-hardness of computational complexity. In this work, a novel energy-efficient hybrid algorithm is proposed to effectively address the scheduling of flexible job shop problems within reasonable time frames. The hybrid framework hybridizes gene expression programming, variable neighborhood search, and simplified mixed integer linear programming approaches to minimize the total energy consumption. It is utilized to address 20 benchmark examples with moderate-or high-complexities. Computational results show that the hybrid algorithm can reach optimality for all considered moderate-size examples within two seconds. The proposed algorithm demonstrates significant competitive advantages relative to the existing mathematical programming approaches and a group-based decomposition method. Specifically, it shortens the computational time over one order of magnitude in some cases and leads to lower total energy consumption with a maximum decrease by 14.5%. |
id |
RCAP_4d69ff2be0c1b774e9a6ceccdebfa549 |
---|---|
oai_identifier_str |
oai:repositorio.ucp.pt:10400.14/43148 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problemsFlexible job shop scheduling has received considerable attention due to its extensive applications in manufacturing. High-quality scheduling solutions are desired but hard to be guaranteed due to the NP-hardness of computational complexity. In this work, a novel energy-efficient hybrid algorithm is proposed to effectively address the scheduling of flexible job shop problems within reasonable time frames. The hybrid framework hybridizes gene expression programming, variable neighborhood search, and simplified mixed integer linear programming approaches to minimize the total energy consumption. It is utilized to address 20 benchmark examples with moderate-or high-complexities. Computational results show that the hybrid algorithm can reach optimality for all considered moderate-size examples within two seconds. The proposed algorithm demonstrates significant competitive advantages relative to the existing mathematical programming approaches and a group-based decomposition method. Specifically, it shortens the computational time over one order of magnitude in some cases and leads to lower total energy consumption with a maximum decrease by 14.5%.Veritati - Repositório Institucional da Universidade Católica PortuguesaLi, DanZheng, TaichengLi, JieTeymourifar, Aydin2023-11-20T17:15:59Z20232023-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.14/43148eng2283-921685179119739info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-09-06T12:44:42Zoai:repositorio.ucp.pt:10400.14/43148Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-09-06T12:44:42Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems |
title |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems |
spellingShingle |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems Li, Dan |
title_short |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems |
title_full |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems |
title_fullStr |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems |
title_full_unstemmed |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems |
title_sort |
A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems |
author |
Li, Dan |
author_facet |
Li, Dan Zheng, Taicheng Li, Jie Teymourifar, Aydin |
author_role |
author |
author2 |
Zheng, Taicheng Li, Jie Teymourifar, Aydin |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Veritati - Repositório Institucional da Universidade Católica Portuguesa |
dc.contributor.author.fl_str_mv |
Li, Dan Zheng, Taicheng Li, Jie Teymourifar, Aydin |
description |
Flexible job shop scheduling has received considerable attention due to its extensive applications in manufacturing. High-quality scheduling solutions are desired but hard to be guaranteed due to the NP-hardness of computational complexity. In this work, a novel energy-efficient hybrid algorithm is proposed to effectively address the scheduling of flexible job shop problems within reasonable time frames. The hybrid framework hybridizes gene expression programming, variable neighborhood search, and simplified mixed integer linear programming approaches to minimize the total energy consumption. It is utilized to address 20 benchmark examples with moderate-or high-complexities. Computational results show that the hybrid algorithm can reach optimality for all considered moderate-size examples within two seconds. The proposed algorithm demonstrates significant competitive advantages relative to the existing mathematical programming approaches and a group-based decomposition method. Specifically, it shortens the computational time over one order of magnitude in some cases and leads to lower total energy consumption with a maximum decrease by 14.5%. |
publishDate |
2023 |
dc.date.none.fl_str_mv |
2023-11-20T17:15:59Z 2023 2023-01-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.14/43148 |
url |
http://hdl.handle.net/10400.14/43148 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
2283-9216 85179119739 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
mluisa.alvim@gmail.com |
_version_ |
1817547106043297792 |