The Job Shop Scheduling Problem (JSSP) is regarded as one of the most challenging issues by the research community in this field due to its complexity. This paper presents a hybrid algorithm called H-PSO-SA for JSSP which is a mixture of two computational artificial intelligence algorithms: Particle Swarm Optimization and Simulated Annealing. In order to demonstrate efficiency of the proposed hybrid algorithm, a series of tests are conducted using a set of classical JSSP benchmarks. The schedule results are compared with outcomes well known in the scientific literature.
Production Scheduling, Job Shop Scheduling Problem, Simulated Annealing, Particle Swarm Optimization
Florentina Alina TOADER, "A Hybrid Algorithm for Job Shop Scheduling Problem", Studies in Informatics and Control, ISSN 1220-1766, vol. 24(2), pp. 171-180, 2015. https://doi.org/10.24846/v24i2y201505
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).