Cargando…

Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time

Makespan dominates the manufacturing expenses in bakery production. The high energy consumption of ovens also has a substantial impact, which bakers may overlook. Bakers leave ovens running until the final product is baked, allowing them to consume energy even when not in use. It results in energy w...

Descripción completa

Detalles Bibliográficos
Autores principales: Babor, Majharulislam, Paquet-Durand, Olivier, Kohlus, Reinhard, Hitzmann, Bernd
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/PMC9816168/
https://www.ncbi.nlm.nih.gov/pubmed/36604451
http://dx.doi.org/10.1038/s41598-022-26866-9
_version_ 1784864471434395648
author Babor, Majharulislam
Paquet-Durand, Olivier
Kohlus, Reinhard
Hitzmann, Bernd
author_facet Babor, Majharulislam
Paquet-Durand, Olivier
Kohlus, Reinhard
Hitzmann, Bernd
author_sort Babor, Majharulislam
collection PubMed
description Makespan dominates the manufacturing expenses in bakery production. The high energy consumption of ovens also has a substantial impact, which bakers may overlook. Bakers leave ovens running until the final product is baked, allowing them to consume energy even when not in use. It results in energy waste, increased manufacturing costs, and CO(2) emissions. This paper investigates three manufacturing lines from small and medium-sized bakeries to find optimum makespan and ovens’ idle time (OIDT). A hybrid no-wait flow shop scheduling model considering the constraints that are most common in bakeries is proposed. To find optimal solutions, non-dominated sorting genetic algorithm (NSGA-II), strength Pareto evolutionary algorithm (SPEA2), generalized differential evolution (GDE3), improved multi-objective particle swarm optimization (OMOPSO), and speed-constrained multi-objective particle swarm optimization (SMPSO) were used. The experimental results show that the shortest makespan does not always imply the lowest OIDT. Even the optimized solutions have up to 231 min of excess OIDT, while the makespan is the shortest. Pareto solutions provide promising trade-offs between makespan and OIDT, with the best-case scenario reducing OIDT by 1348 min while increasing makespan only by 61 min from the minimum possible makespan. NSGA-II outperforms all other algorithms in obtaining a high number of good-quality solutions and a small number of poor-quality solutions, followed by SPEA2 and GDE3. In contrast, OMOPSO and SMPSO deliver the worst solutions, which become pronounced as the problem complexity grows.
format Online
Article
Text
id pubmed-9816168
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher Nature Publishing Group UK
record_format MEDLINE/PubMed
spelling pubmed-98161682023-01-07 Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time Babor, Majharulislam Paquet-Durand, Olivier Kohlus, Reinhard Hitzmann, Bernd Sci Rep Article Makespan dominates the manufacturing expenses in bakery production. The high energy consumption of ovens also has a substantial impact, which bakers may overlook. Bakers leave ovens running until the final product is baked, allowing them to consume energy even when not in use. It results in energy waste, increased manufacturing costs, and CO(2) emissions. This paper investigates three manufacturing lines from small and medium-sized bakeries to find optimum makespan and ovens’ idle time (OIDT). A hybrid no-wait flow shop scheduling model considering the constraints that are most common in bakeries is proposed. To find optimal solutions, non-dominated sorting genetic algorithm (NSGA-II), strength Pareto evolutionary algorithm (SPEA2), generalized differential evolution (GDE3), improved multi-objective particle swarm optimization (OMOPSO), and speed-constrained multi-objective particle swarm optimization (SMPSO) were used. The experimental results show that the shortest makespan does not always imply the lowest OIDT. Even the optimized solutions have up to 231 min of excess OIDT, while the makespan is the shortest. Pareto solutions provide promising trade-offs between makespan and OIDT, with the best-case scenario reducing OIDT by 1348 min while increasing makespan only by 61 min from the minimum possible makespan. NSGA-II outperforms all other algorithms in obtaining a high number of good-quality solutions and a small number of poor-quality solutions, followed by SPEA2 and GDE3. In contrast, OMOPSO and SMPSO deliver the worst solutions, which become pronounced as the problem complexity grows. Nature Publishing Group UK 2023-01-05 /pmc/articles/PMC9816168/ /pubmed/36604451 http://dx.doi.org/10.1038/s41598-022-26866-9 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
Babor, Majharulislam
Paquet-Durand, Olivier
Kohlus, Reinhard
Hitzmann, Bernd
Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
title Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
title_full Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
title_fullStr Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
title_full_unstemmed Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
title_short Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
title_sort modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9816168/
https://www.ncbi.nlm.nih.gov/pubmed/36604451
http://dx.doi.org/10.1038/s41598-022-26866-9
work_keys_str_mv AT babormajharulislam modelingandoptimizationofbakeryproductionschedulingtominimizemakespanandovenidletime
AT paquetdurandolivier modelingandoptimizationofbakeryproductionschedulingtominimizemakespanandovenidletime
AT kohlusreinhard modelingandoptimizationofbakeryproductionschedulingtominimizemakespanandovenidletime
AT hitzmannbernd modelingandoptimizationofbakeryproductionschedulingtominimizemakespanandovenidletime