Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time.
Journal
Scientific reports
ISSN: 2045-2322
Titre abrégé: Sci Rep
Pays: England
ID NLM: 101563288
Informations de publication
Date de publication:
05 01 2023
05 01 2023
Historique:
received:
09
08
2022
accepted:
21
12
2022
entrez:
5
1
2023
pubmed:
6
1
2023
medline:
10
1
2023
Statut:
epublish
Résumé
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
Identifiants
pubmed: 36604451
doi: 10.1038/s41598-022-26866-9
pii: 10.1038/s41598-022-26866-9
pmc: PMC9816168
doi:
Types de publication
Journal Article
Research Support, Non-U.S. Gov't
Langues
eng
Sous-ensembles de citation
IM
Pagination
235Informations de copyright
© 2023. The Author(s).
Références
Babor, M. et al. Automation Science and Technology (Food2Multimedia GmbH, Radbruch, 2021).
Zentralverband des Deutschen Bäckerhandwerks e. V. Wirtschaftsfaktor Bäckerhandwerk. (2022).
Gonzalez, T. & Sahni, S. Flowshop and jobshop schedules: Complexity and approximation. Oper. Res. 26, 36–52 (1978).
doi: 10.1287/opre.26.1.36
Liang, Z., Zhong, P., Liu, M., Zhang, C. & Zhang, Z. A computational efficient optimization of flow shop scheduling problems. Sci. Rep. 12, 845 (2022).
doi: 10.1038/s41598-022-04887-8
Babor, M., Senge, J., Rosell, C. M., Rodrigo, D. & Hitzmann, B. Optimization of no-wait flowshop scheduling problem in bakery production with modified PSO. NEH SA. Process. 9, 2044 (2021).
doi: 10.3390/pr9112044
Hecker, F. T., Stanke, M., Becker, T. & Hitzmann, B. Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery. Expert Syst. Appl. 41, 5882–5891 (2014).
doi: 10.1016/j.eswa.2014.03.047
Swangnop, S., Duangdee, T. & Duangdee, J. Design of production planning process for bakery manufacturer. In 2019 IEEE 6th International Conference on Industrial Engineering and Applications (ICIEA) 178–182 (2019). https://doi.org/10.1109/IEA.2019.8714851 .
Wang, S., Wang, X., Chu, F. & Yu, J. An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production. Int. J. Prod. Res. 58, 2283–2314 (2020).
doi: 10.1080/00207543.2019.1624857
Liu, L., Chang, Z. & Song, S. Optimization of a molten iron scheduling problem with uncertain processing time using variable neighborhood search algorithm. Sci. Rep. 12, 7303 (2022).
doi: 10.1038/s41598-022-10891-9
Fathollahi-Fard, A. M., Woodward, L. & Akhrif, O. Sustainable distributed permutation flow-shop scheduling model based on a triple bottom line concept. J. Ind. Inf. Integr. 24, 100233 (2021).
Dziurzanski, P. et al. Solving the multi-objective flexible job-shop scheduling problem with alternative recipes for a chemical production process. In Applications of evolutionary computation (eds Kaufmann, P. & Castillo, P. A.) 33–48 (Springer, 2019). https://doi.org/10.1007/978-3-030-16692-2_3 .
doi: 10.1007/978-3-030-16692-2_3
Du, J., Zhang, Z., Li, M., Guo, J. & Zhu, K. Optimal scheduling of integrated energy system based on improved grey wolf optimization algorithm. Sci. Rep. 12, 7095 (2022).
doi: 10.1038/s41598-022-10958-7
Ala, A., Alsaadi, F. E., Ahmadi, M. & Mirjalili, S. Optimization of an appointment scheduling problem for healthcare systems based on the quality of fairness service using whale optimization algorithm and NSGA-II. Sci. Rep. 11, 19816 (2021).
doi: 10.1038/s41598-021-98851-7
Ikeda, K., Nakamura, Y. & Humble, T. S. Application of quantum annealing to nurse scheduling problem. Sci. Rep. 9, 12837 (2019).
doi: 10.1038/s41598-019-49172-3
Valdano, E., Poletto, C., Boëlle, P.-Y. & Colizza, V. Reorganization of nurse scheduling reduces the risk of healthcare associated infections. Sci. Rep. 11, 7393 (2021).
doi: 10.1038/s41598-021-86637-w
Wang, S., Wang, X. & Yu, L. Two-stage no-wait hybrid flow-shop scheduling with sequence-dependent setup times. Int. J. Syst. Sci. Oper. Logist. 7, 291–307 (2020).
Yuksel, D., Tasgetiren, M. F., Kandiller, L. & Pan, Q. -K. Metaheuristics for energy-efficient no-wait flowshops: A trade-off between makespan and total energy consumption. In 2020 IEEE Congress on Evolutionary Computation (CEC) 1–8 (IEEE, 2020). doi: https://doi.org/10.1109/CEC48606.2020.9185554 .
Zhang, F., Bai, J., Yang, D. & Wang, Q. Digital twin data-driven proactive job-shop scheduling strategy towards asymmetric manufacturing execution decision. Sci. Rep. 12, 1546 (2022).
doi: 10.1038/s41598-022-05304-w
Zhou, L. et al. Production and operations management for intelligent manufacturing: A systematic literature review. Int. J. Prod. Res. 60, 808–846 (2022).
doi: 10.1080/00207543.2021.2017055
Huber, J. & Stuckenschmidt, H. Intraday shelf replenishment decision support for perishable goods. Int. J. Prod. Econ. 231, 107828 (2021).
doi: 10.1016/j.ijpe.2020.107828
Therkelsen, P., Masanet, E. & Worrell, E. Energy efficiency opportunities in the U.S. commercial baking industry. J. Food Eng. 130, 14–22 (2014).
doi: 10.1016/j.jfoodeng.2014.01.004
Bouman, C. A. et al. CLUSTER: An unsupervised algorithm for modeling gaussian mixtures. 20 (1997).
Babor, M. & Hitzmann, B. Application of nature-inspired multi-objective optimization algorithms to improve the bakery production efficiency. In ECP 2022 31 (MDPI, 2022). doi: https://doi.org/10.3390/ECP2022-12630 .
Ye, H., Li, W. & Nault, B. R. Trade-off balancing between maximum and total completion times for no-wait flow shop production. Int. J. Prod. Res. 58, 3235–3251 (2020).
doi: 10.1080/00207543.2019.1630777
Babor, M. & Hitzmann, B. Small and medium-sized bakery production data for scheduling. (2022) https://doi.org/10.17632/DHGBSSB8NS.2 .
Van Rossum, G. & Drake Jr, F. Python Tutorial; Technical Report CS-R9526. (Centrum voor Wiskunde en Informatica (CWI): Amsterdam, The Netherlands, 1995).
Deb, K., Pratap, A., Agarwal, S. & Meyarivan, T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Computat. 6, 182–197 (2002).
doi: 10.1109/4235.996017
Fonseca, C. M. & Fleming, P. J. Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization (1993).
Horn, J. D., Nafpliotis, N. & Goldberg, D. A niched Pareto genetic algorithm for multiobjective optimization. In Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence (1994). https://doi.org/10.1109/ICEC.1994.350037 .
Srinivas, N. & Deb, K. Multiobjective function optimization using nondominated sorting genetic algorithms. Evol. Comput. 2, 1301–1308 (1994).
doi: 10.1162/evco.1994.2.3.221
Zitzler, E., Deb, K. & Thiele, L. Comparison of multiobjective evolutionary algorithms: Empirical results. Evol. Comput. 8, 173–195 (2000).
doi: 10.1162/106365600568202
Zitzler, E., Laumanns, M. & Thiele, L. SPEA2: Improving the strength pareto evolutionary algorithm. In: Computer Engineering and Networks Laboratory (TIK) Department of Electrical Engineering Swiss Federal Institute of Technology (ETH) Zurich ETH Zentrum TIK-Report 103, (2001).
Zitzler, E. & Thiele, L. An evolutionary algorithm for multiobjective optimization: The strength pareto approach. Computer Engineering and Communication Networks Lab TIK, Swiss Federal Institute of Technology ETH 43 (1998).
Elhossini, A., Areibi, S. & Dony, R. Strength pareto particle swarm optimization and hybrid EA-PSO for multi-objective optimization. Evol. Comput. 18, 127–156 (2010).
doi: 10.1162/evco.2010.18.1.18105
Emmerich, M. T. M. & Deutz, A. H. A tutorial on multiobjective optimization: Fundamentals and evolutionary methods. Nat.Comput. 17, 585–609 (2018).
doi: 10.1007/s11047-018-9685-y
Kukkonen, S. & Lampinen, J. GDE3: The third evolution step of generalized differential evolution. In: 2005 IEEE Congress on Evolutionary Computation, vol. 1, 443–450 (2005).
Eberhart, R. & Kennedy, J. A new optimizer using particle swarm theory. In MHS’95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science 39–43 (1995). https://doi.org/10.1109/MHS.1995.494215 .
Coello, C. A. C., Pulido, G. T. & Lechuga, M. S. Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8, 256–279 (2004).
doi: 10.1109/TEVC.2004.826067
Coello, C. C. & Lechuga, M. S. MOPSO: A proposal for multiple objective particle swarm optimization. In Proceedings of the 2002 Congress on Evolutionary Computation. CEC’02 (Cat. No. 02TH8600), Vol. 2, 1051–1056 (IEEE, 2002).
Durillo, J. J. et al. Multi-objective particle swarm optimizers: An experimental comparison. In Evolutionary Multi-criterion Optimization (eds Ehrgott, M. et al.) 495–509 (Springer, 2009). https://doi.org/10.1007/978-3-642-01020-0_39 .
doi: 10.1007/978-3-642-01020-0_39
Hu, X. & Eberhart, R. Multiobjective optimization using dynamic neighborhood particle swarm optimization. I:n Proceedings of the 2002 Congress on Evolutionary Computation. CEC’02 (Cat. No.02TH8600), Vol. 2, 1677–1681 (2002).
Nebro, A. J. et al. SMPSO: A new PSO-based metaheuristic for multi-objective optimization. In: 2009 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making(MCDM) 66–73 (2009). doi: https://doi.org/10.1109/MCDM.2009.4938830 .
Ray, T. & Liew, K. M. A swarm metaphor for multiobjective design optimization. Eng. Optim. 34, 141–153 (2002).
doi: 10.1080/03052150210915
Sierra, M. R. & Coello Coello, C. A. Improving PSO-based multi-objective optimization using crowding, mutation and ∈-dominance. In Evolutionary Multi-Criterion Optimization (eds Coello Coello, C. A. et al.) 505–519 (Springer, 2005). https://doi.org/10.1007/978-3-540-31880-4_35 .
doi: 10.1007/978-3-540-31880-4_35
Sun, Y. & Gao, Y. A multi-objective particle swarm optimization algorithm based on Gaussian mutation and an improved learning strategy. Mathematics 7, 148 (2019).
doi: 10.3390/math7020148
Ahmadi, E., Zandieh, M., Farrokh, M. & Emami, S. M. A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput. Oper. Res. 73, 56–66 (2016).
doi: 10.1016/j.cor.2016.03.009
Deliktaş, D., Özcan, E., Ustun, O. & Torkul, O. Evolutionary algorithms for multi-objective flexible job shop cell scheduling. Appl. Soft Comput. 113, 107890 (2021).
doi: 10.1016/j.asoc.2021.107890
He, L., Cao, Y., Li, W., Cao, J. & Zhong, L. Optimization of energy-efficient open shop scheduling with an adaptive multi-objective differential evolution algorithm. Appl. Soft Comput. 118, 108459 (2022).
doi: 10.1016/j.asoc.2022.108459
Li, X. & Ma, S. Multi-objective memetic search algorithm for multi-objective permutation flow shop scheduling problem. IEEE Access 4, 2154–2165 (2016).
doi: 10.1109/ACCESS.2016.2565622
Santos, V. L. A., Carvalho, T. F. M., de Assis, L. P., Weiss-Cohen, M. & Guimarães, F. G. Multi-objective iterated local search based on decomposition for job scheduling problems with machine deterioration effect. Eng. Appl. Artif. Intell. 112, 104826 (2022).
doi: 10.1016/j.engappai.2022.104826
Abido, M. A. & Elazouni, A. Modified multi-objective evolutionary programming algorithm for solving project scheduling problems. Expert Syst. Appl. 183, 115338 (2021).
doi: 10.1016/j.eswa.2021.115338
Ye, H., Li, W., Abedini, A. & Nault, B. An effective and efficient heuristic for no-wait flow shop production to minimize total completion time. Comput. Ind. Eng. 108, 57–69 (2017).
doi: 10.1016/j.cie.2017.04.002
Ye, H., Li, W. & Abedini, A. An improved heuristic for no-wait flow shop to minimize makespan. J. Manuf. Syst. 44, 273–279 (2017).
doi: 10.1016/j.jmsy.2017.04.007
Jolliffe, I. T. Principal Component Analysis (Springer-Verlag, 2002).
Babor, M., Pedersen, L., Kidmose, U., Paquet-Durand, O. & Hitzmann, B. Application of non-dominated sorting genetic algorithm (NSGA-II) to increase the efficiency of bakery production: A case study. Processes 10, 1623 (2022).
doi: 10.3390/pr10081623
Ye, H., Wang, X. & Liu, K. Adaptive preventive maintenance for flow shop scheduling with resumable processing. IEEE Trans. Automat. Sci. Eng. 18, 106–113 (2021).
doi: 10.1109/TASE.2020.2978890
Miyata, H. H., Nagano, M. S. & Gupta, J. N. D. Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Comput. Ind. Eng. 135, 79–104 (2019).
doi: 10.1016/j.cie.2019.05.034
Storn, R. & Price, K. Differential evolution – A simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341–359 (1997).
doi: 10.1023/A:1008202821328
Kukkonen, S. & Lampinen, J. An Extension of Generalized Differential Evolution for Multi-objective Optimization with Constraints. in Parallel Problem Solving from Nature - PPSN VIII (eds. Yao, X. et al.) 752–761 (Springer, 2004). doi: https://doi.org/10.1007/978-3-540-30217-9_76 .
Lampinen, J. A constraint handling approach for the differential evolution algorithm. in Proceedings of the 2002 Congress on Evolutionary Computation. CEC’02 (Cat. No.02TH8600) vol. 2 1468–1473 (2002).