Solving the energy-aware flexible job shop problem using a memetic algorithm

This article addresses the flexible job shop problem with interval processing times. Minimising makespan is a well-known scheduling objective that is widely used in many sectors; however, energy efficiency is gaining more importance as climate change intensifies. In this work, we minimise the makesp...

Descripción completa

Detalles Bibliográficos
Autores: Afsar, Sezin, Puente Peinador, Jorge, Palacios Alonso, Juan José, González Rodríguez, Inés|||0000-0003-3266-009X, Rodríguez Vela, Camino
Tipo de recurso: artículo
Fecha de publicación:2025
País:España
Institución:Universidad de Cantabria (UC)
Repositorio:UCrea Repositorio Abierto de la Universidad de Cantabria
Idioma:inglés
OAI Identifier:oai:dnet:ucreareposit::780c588e8fd7ea359935bdee00a022ce
Acceso en línea:https://hdl.handle.net/10902/39912
Access Level:acceso abierto
Palabra clave:Flexible job shop scheduling
Interval
Memetic algorithm
Local search
Lexicographic goal programming
id ES_0d7e9f6acb7c2989ac2dfd8b4c583864
oai_identifier_str oai:dnet:ucreareposit::780c588e8fd7ea359935bdee00a022ce
network_acronym_str ES
network_name_str España
repository_id_str
spelling Solving the energy-aware flexible job shop problem using a memetic algorithmAfsar, SezinPuente Peinador, JorgePalacios Alonso, Juan JoséGonzález Rodríguez, Inés|||0000-0003-3266-009XRodríguez Vela, CaminoFlexible job shop schedulingIntervalMemetic algorithmLocal searchLexicographic goal programmingThis article addresses the flexible job shop problem with interval processing times. Minimising makespan is a well-known scheduling objective that is widely used in many sectors; however, energy efficiency is gaining more importance as climate change intensifies. In this work, we minimise the makespan and the total energy consumption using a lexicographic goal programming approach. A memetic algorithm that is composed of a genetic algorithm and a local search method is developed and tested to solve this problem. The results show that our approach manages to improve the best-known results.The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research has been supported by the Spanish Government under research Grants TED2021 131938B-I00 and PID2022-141746OB-I00, and by the Principality of Asturias under research Grant GRU-GIC-24 018.IOS PressUniversidad de Cantabria20252025-11-01journal articlehttp://purl.org/coar/resource_type/c_6501NAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/articlehttps://hdl.handle.net/10902/39912Integrated Computer-Aided Engineering, 2025, 32(4), 397-414reponame:UCrea Repositorio Abierto de la Universidad de Cantabriainstname:Universidad de Cantabria (UC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial 4.0 Internationalhttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccessoai:dnet:ucreareposit::780c588e8fd7ea359935bdee00a022ce2026-06-02T12:39:31Z
dc.title.none.fl_str_mv Solving the energy-aware flexible job shop problem using a memetic algorithm
title Solving the energy-aware flexible job shop problem using a memetic algorithm
spellingShingle Solving the energy-aware flexible job shop problem using a memetic algorithm
Afsar, Sezin
Flexible job shop scheduling
Interval
Memetic algorithm
Local search
Lexicographic goal programming
title_short Solving the energy-aware flexible job shop problem using a memetic algorithm
title_full Solving the energy-aware flexible job shop problem using a memetic algorithm
title_fullStr Solving the energy-aware flexible job shop problem using a memetic algorithm
title_full_unstemmed Solving the energy-aware flexible job shop problem using a memetic algorithm
title_sort Solving the energy-aware flexible job shop problem using a memetic algorithm
dc.creator.none.fl_str_mv Afsar, Sezin
Puente Peinador, Jorge
Palacios Alonso, Juan José
González Rodríguez, Inés|||0000-0003-3266-009X
Rodríguez Vela, Camino
author Afsar, Sezin
author_facet Afsar, Sezin
Puente Peinador, Jorge
Palacios Alonso, Juan José
González Rodríguez, Inés|||0000-0003-3266-009X
Rodríguez Vela, Camino
author_role author
author2 Puente Peinador, Jorge
Palacios Alonso, Juan José
González Rodríguez, Inés|||0000-0003-3266-009X
Rodríguez Vela, Camino
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Universidad de Cantabria
dc.subject.none.fl_str_mv Flexible job shop scheduling
Interval
Memetic algorithm
Local search
Lexicographic goal programming
topic Flexible job shop scheduling
Interval
Memetic algorithm
Local search
Lexicographic goal programming
description This article addresses the flexible job shop problem with interval processing times. Minimising makespan is a well-known scheduling objective that is widely used in many sectors; however, energy efficiency is gaining more importance as climate change intensifies. In this work, we minimise the makespan and the total energy consumption using a lexicographic goal programming approach. A memetic algorithm that is composed of a genetic algorithm and a local search method is developed and tested to solve this problem. The results show that our approach manages to improve the best-known results.
publishDate 2025
dc.date.none.fl_str_mv 2025
2025-11-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/10902/39912
url https://hdl.handle.net/10902/39912
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial 4.0 International
http://creativecommons.org/licenses/by-nc/4.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial 4.0 International
http://creativecommons.org/licenses/by-nc/4.0/
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv IOS Press
publisher.none.fl_str_mv IOS Press
dc.source.none.fl_str_mv Integrated Computer-Aided Engineering, 2025, 32(4), 397-414
reponame:UCrea Repositorio Abierto de la Universidad de Cantabria
instname:Universidad de Cantabria (UC)
instname_str Universidad de Cantabria (UC)
reponame_str UCrea Repositorio Abierto de la Universidad de Cantabria
collection UCrea Repositorio Abierto de la Universidad de Cantabria
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869403343097430016
score 15,81155

Similares en LA Referencia