Title: PSO and simulated annealing for the two-machine flowshop scheduling problem with coupled-operations
Authors: Nadjat Meziani; Mourad Boudhar; Ammar Oulamara
Addresses: Abderrahmane Mira University, Bejaia, Algeria ' RECITS Laboratory, Faculty of Mathematics, University USTHB, BP 32, Bab-Ezzouar, El-Alia 16111, Algiers, Algeria ' LORIA Laboratory – UMR7503, University of Lorraine, Campus scientifique, BP 239, 54506 Vandoeuvre-lès-Nancy, France
Abstract: In this paper, we proposed an hybrid algorithm combining particle swarm optimisation with the simulated annealing (PSO-SA) to solve the flowshop problem with coupled-operations in the presence of the time lags. The criterion to minimise is the makespan. To verify the performance of the hybridised algorithm, computational experiments are performed and the obtained results are compared with the simulated annealing and PSO algorithms. However, the experimental results show that the PSO-SA performs better than the others approaches. [Received: 6 May 2017; Revised: 20 July 2017; Revised: 17 September 2017; Accepted: 16 September 2017]
Keywords: flowshop; coupled-operations; makespan; PSO; simulated annealing.
European Journal of Industrial Engineering, 2018 Vol.12 No.1, pp.43 - 66
Available online: 12 Feb 2018 *Full-text access for editors Access for subscribers Purchase this article Comment on this article