Affiliations: [a] Department of Computing, University of Oviedo, Gijón, Spain | [b] Departamento de Matemáticas, Estadística y Computación, Universidad de Cantabria, Santander, Spain
Correspondence:
[*]
Corresponding author: Camino R. Vela, Department of Computing, University of Oviedo, Gijón, Spain. E-mail: [email protected].
Abstract: In this paper, a novel Artificial Bee Colony algorithm is proposed to solve a variant of the Job Shop Scheduling Problem where only an interval of possible processing times is known for each operation. The solving method incorporates a diversification strategy based on the seasonal behaviour of bees. That is, the bees tend to explore more at the beginning of the search (spring) and be more conservative towards the end (summer to winter). This new strategy helps the algorithm avoid premature convergence, which appeared to be an issue in previous papers tackling the same problem. A thorough parametric analysis is conducted and a comparison of different seasonal models is performed on a set of benchmark instances from the literature. The results illustrate the benefit of using the new strategy, improving the performance of previous ABC-based methods for the same problem. An additional study is conducted to assess the robustness of the solutions obtained under different ranking operators, together with a sensitivity analysis to compare the effect that different levels of uncertainty have on the solutions’ robustness.
