The full text of this article
Solving hybrid flow shop scheduling problems using bat algorithm
by M.K. Marichelvam; T. Prabaharan; Xin-She Yang; M. Geetha
International Journal of Logistics Economics and Globalisation (IJLEG), Vol. 5, No. 1, 2013
Abstract: This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed bat meta-heuristic algorithm is proposed to solve the HFS problems. The proposed algorithm is validated with a well-chosen set of benchmark problems in the literature. Computational results indicate that the proposed bat algorithm is more efficient than the genetic algorithm and particle swarm optimisation.
Online publication date: Fri, 07-Jun-2013
is only available to individual subscribers or to users at subscribing institutions.
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 Logistics Economics and Globalisation (IJLEG):
Login with your Inderscience username and 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 email@example.com