Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm

Kuo-Ching Ying

European Journal of Industrial Engineering, 2012, vol. 6, issue 2, 199-215

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]

Keywords: multistage flow shops; hybrid flow shops; multiprocessor tasks; hybrid immune algorithm; HIA; flow shop scheduling; makespan; artificial immune systems; iterated greedy algorithm; metaheuristics. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=45605 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:6:y:2012:i:2:p:199-215

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().