Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm
by Kuo-Ching Ying
European J. of Industrial Engineering (EJIE), Vol. 6, No. 2, 2012

Abstract: The scheduling problem of multistage hybrid flowshop with multiprocessor tasks is a core topic for numerous industrial applications but under-represented in the research literature. In this study, a new hybrid immune algorithm based on the features of artificial immune systems and iterated greedy algorithms is presented to minimise the makespan of this problem. To validate the performance of the proposed algorithm, computational experiments are conducted on two well-known benchmark problem sets. The experiment results clearly reveal that the proposed algorithm is highly effective and efficient as compared to three state-of-the-art metaheuristics on the same benchmark instances. [Received 26 February 2010; Revised 19 July 2010, 17 October 2010; Accepted 25 October 2010]

Online publication date: Wed, 10-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 European J. of Industrial Engineering (EJIE):
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