Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion
by Ömür Tosun
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 5, No. 3, 2014

Abstract: In this paper, a modified artificial bee colony algorithm is proposed to solve the permutation flow shop scheduling problem with makespan criterion. Originally developed for numerical optimisation, local search techniques are integrated into the algorithm to solve flow shop problems. Carlier and Reeves test problems from the literature are used to compare the performance of the algorithm against the best known solutions, NEH and with different meta-heuristic techniques. It is seen that for all the Carlier's instances, proposed algorithm is able to find the best solutions, whereas for the Reeves's cases best solutions of 13 problems from a total of 21 are found. Also, a new best solution is found for the Rec23 instance. Finally, statistical analyses are done to evaluate the proposed algorithm's performance.

Online publication date: Thu, 18-Sep-2014

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 Mathematical Modelling and Numerical Optimisation (IJMMNO):
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