An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems Online publication date: Mon, 22-Sep-2014
by M.K. Marichelvam
International Journal of Bio-Inspired Computation (IJBIC), Vol. 4, No. 4, 2012
Abstract: Permutation flow shop scheduling problems with makespan minimisation are considered in this paper. Flow shop scheduling is one important type of scheduling problems for the past several decades. Flow shop scheduling problems are non-deterministic polynomial time hard (NP-hard) problems. Hence the exact methods can not be used to solve these problems. Many heuristics and metaheuristics were addressed in the literature to solve the flow shop scheduling problems. Cuckoo Search is a recently developed metaheuristics algorithm. The efficiency of the algorithm may decrease as the parameters of the Cuckoo Search are constant. Hence an improved hybrid Cuckoo Search (IHCS) algorithm is developed in the present work to solve the permutation flow shop scheduling problems. The proposed algorithm has been implemented for some benchmark problems in the literature and the results are compared with some other metaheuristics algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Bio-Inspired Computation (IJBIC):
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook