Cargando…
Learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling
The incorporation of energy conservation measures into production efficiency is widely recognized as a crucial aspect of contemporary industry. This study aims to develop interpretable and high-quality dispatching rules for energy-aware dynamic job shop scheduling (EDJSS). In comparison to the tradi...
Autores principales: | , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10219999/ https://www.ncbi.nlm.nih.gov/pubmed/37236998 http://dx.doi.org/10.1038/s41598-023-34951-w |
_version_ | 1785049126163972096 |
---|---|
author | Sitahong, Adilanmu Yuan, Yiping Li, Ming Ma, Junyan Ba, Zhiyong Lu, Yongxin |
author_facet | Sitahong, Adilanmu Yuan, Yiping Li, Ming Ma, Junyan Ba, Zhiyong Lu, Yongxin |
author_sort | Sitahong, Adilanmu |
collection | PubMed |
description | The incorporation of energy conservation measures into production efficiency is widely recognized as a crucial aspect of contemporary industry. This study aims to develop interpretable and high-quality dispatching rules for energy-aware dynamic job shop scheduling (EDJSS). In comparison to the traditional modeling methods, this paper proposes a novel genetic programming with online feature selection mechanism to learn dispatching rules automatically. The idea of the novel GP method is to achieve a progressive transition from exploration to exploitation by relating the level of population diversity to the stopping criteria and elapsed duration. We hypothesize that diverse and promising individuals obtained from the novel GP method can guide the feature selection to design competitive rules. The proposed approach is compared with three GP-based algorithms and 20 benchmark rules in the different job shop conditions and scheduling objectives considered energy consumption. Experiments show that the proposed approach greatly outperforms the compared methods in generating more interpretable and effective rules. Overall, the average improvement over the best-evolved rules by the other three GP-based algorithms is 12.67%, 15.38%, and 11.59% in the meakspan with energy consumption (EMS), mean weighted tardiness with energy consumption (EMWT), and mean flow time with energy consumption (EMFT) scenarios, respectively. |
format | Online Article Text |
id | pubmed-10219999 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | Nature Publishing Group UK |
record_format | MEDLINE/PubMed |
spelling | pubmed-102199992023-05-28 Learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling Sitahong, Adilanmu Yuan, Yiping Li, Ming Ma, Junyan Ba, Zhiyong Lu, Yongxin Sci Rep Article The incorporation of energy conservation measures into production efficiency is widely recognized as a crucial aspect of contemporary industry. This study aims to develop interpretable and high-quality dispatching rules for energy-aware dynamic job shop scheduling (EDJSS). In comparison to the traditional modeling methods, this paper proposes a novel genetic programming with online feature selection mechanism to learn dispatching rules automatically. The idea of the novel GP method is to achieve a progressive transition from exploration to exploitation by relating the level of population diversity to the stopping criteria and elapsed duration. We hypothesize that diverse and promising individuals obtained from the novel GP method can guide the feature selection to design competitive rules. The proposed approach is compared with three GP-based algorithms and 20 benchmark rules in the different job shop conditions and scheduling objectives considered energy consumption. Experiments show that the proposed approach greatly outperforms the compared methods in generating more interpretable and effective rules. Overall, the average improvement over the best-evolved rules by the other three GP-based algorithms is 12.67%, 15.38%, and 11.59% in the meakspan with energy consumption (EMS), mean weighted tardiness with energy consumption (EMWT), and mean flow time with energy consumption (EMFT) scenarios, respectively. Nature Publishing Group UK 2023-05-26 /pmc/articles/PMC10219999/ /pubmed/37236998 http://dx.doi.org/10.1038/s41598-023-34951-w Text en © The Author(s) 2023 https://creativecommons.org/licenses/by/4.0/Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) . |
spellingShingle | Article Sitahong, Adilanmu Yuan, Yiping Li, Ming Ma, Junyan Ba, Zhiyong Lu, Yongxin Learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling |
title | Learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling |
title_full | Learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling |
title_fullStr | Learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling |
title_full_unstemmed | Learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling |
title_short | Learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling |
title_sort | learning dispatching rules via novel genetic programming with feature selection in energy-aware dynamic job-shop scheduling |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10219999/ https://www.ncbi.nlm.nih.gov/pubmed/37236998 http://dx.doi.org/10.1038/s41598-023-34951-w |
work_keys_str_mv | AT sitahongadilanmu learningdispatchingrulesvianovelgeneticprogrammingwithfeatureselectioninenergyawaredynamicjobshopscheduling AT yuanyiping learningdispatchingrulesvianovelgeneticprogrammingwithfeatureselectioninenergyawaredynamicjobshopscheduling AT liming learningdispatchingrulesvianovelgeneticprogrammingwithfeatureselectioninenergyawaredynamicjobshopscheduling AT majunyan learningdispatchingrulesvianovelgeneticprogrammingwithfeatureselectioninenergyawaredynamicjobshopscheduling AT bazhiyong learningdispatchingrulesvianovelgeneticprogrammingwithfeatureselectioninenergyawaredynamicjobshopscheduling AT luyongxin learningdispatchingrulesvianovelgeneticprogrammingwithfeatureselectioninenergyawaredynamicjobshopscheduling |