Hybrid bat algorithm for flow shop scheduling problems
by Ömür Tosun; M.K. Marichelvam
International Journal of Mathematics in Operational Research (IJMOR), Vol. 9, No. 1, 2016

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.

Online publication date: Wed, 06-Jul-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com