Title: Hybrid bat algorithm for flow shop scheduling problems

Authors: Ömür Tosun; M.K. Marichelvam

Addresses: Department of International Trade and Logistics, Ayşe Sak School of Applied Sciences, Akdeniz University, Yeşilbayır, Antalya, Turkey ' Department of Mechanical Engineering, Mepco Schlenk Engineering College, Sivakasi, Tamilnadu, 626005, India

Abstract: In this paper, a hybrid bat algorithm is proposed to solve the permutation flow shop scheduling problems with makespan criterion. Developed for numerical optimisation, local search techniques are integrated into the bat algorithm to solve the flow shop problems. Reeves test problems from the literature are used to compare the performance of the proposed algorithm against the best known solutions, NEH and with different metaheuristics. Computational results and statistical analysis indicate that the proposed algorithm can be more efficient than many other metaheuristic algorithms addressed in the literature.

Keywords: flowshop scheduling; makespan; bat algorithm; metaheuristics; local search.

DOI: 10.1504/IJMOR.2016.077560

International Journal of Mathematics in Operational Research, 2016 Vol.9 No.1, pp.125 - 138

Received: 03 Sep 2014
Accepted: 19 Oct 2014
Published online: 06 Jul 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article