A Hybrid Algorithm for Job Shop Scheduling Problem

Florentina Alina TOADER
Petroleum Gas University of Ploiesti,
39 Bucuresti Blvd , Ploiesti, 100680, Romania
toader_florentina_alina@yahoo.com

Abstract: 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.

Keywords: Production Scheduling, Job Shop Scheduling Problem, Simulated Annealing, Particle Swarm Optimization

>Full text
CITE THIS PAPER AS:
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