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

Authors: Kuo-Ching Ying

Addresses: Department of Industrial Engineering and Management, National Taipei University of Technology, No. 1, Section 3, Chung-Hsiao East Road, Taipei, Taiwan

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.

DOI: 10.1504/EJIE.2012.045605

European Journal of Industrial Engineering, 2012 Vol.6 No.2, pp.199 - 215

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 23 Feb 2012 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article