Affiliation:
1. Universidad de Cantabria, Santander, Spain
2. Universidad de Oviedo, Oviedo, Spain
Abstract
The flexible job shop is a well-known scheduling problem that has historically attracted much research attention both because of its computational complexity and its importance in manufacturing and engineering processes. Here we consider a variant of the problem where uncertainty in operation processing times is modeled using triangular fuzzy numbers. Our objective is to minimize the total energy consumption, which combines the energy required by resources when they are actively processing an operation and the energy consumed by these resources simply for being switched on. To solve this NP-Hard problem, we propose a memetic algorithm, a hybrid metaheuristic method that combines global search with local search. Our focus has been on obtaining an efficient method, capable of obtaining similar solutions quality-wise to the state of the art using a reduced amount of time. To assess the performance of our algorithm, we present an extensive experimental analysis that compares it with previous proposals and evaluates the effect on the search of its different components.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science,Software
Reference80 articles.
1. Pinedo ML. Scheduling. Theory, Algorithms, and Systems. 5th ed. Springer; 2016.
2. Błazewicz J, Ecker KH, Pesch E, Schmidt G, Sterna M, Wȩglarz J. Handbook on Scheduling: From Theory to Practice. Second edition ed. International Handbooks on Information Systems. Springer; 2019.
3. A hybrid granular-evolutionary computing method for cooperative scheduling optimization on integrated energy system in steel industry;Han;Swarm and Evolutionary Computation,2022
4. A hybrid approach for improving the flexibility of production scheduling in flat steel industry;Iannino;Integrated Computer-Aided Engineering,2022
5. Scheduling Under Uncertainty for Industry 4.0 and 5.0;Bakon;IEEE Access,2022
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献