¹Huafan University, Taipei, Taiwan, ROC

Correspondence: K-C Ying, No. 1, Huafan Road, Shihting Hsiang, Taipei Hsien, Taiwan 223 ROC. E-mail: kcying@huafan.hfu.edu.tw

Received March 2007; Accepted March 2008; Published online 28 May 2008.

Abstract

This paper proposes a simple iterated greedy (IG) heuristic to minimize makespan in a multistage hybrid flowshop with multiprocessor tasks. To validate and verify the proposed heuristic, computational experiments have been conducted on two well-known benchmark problem sets. The experiment results clearly reveal that the proposed IG heuristic is highly effective as compared to three state-of-the-art meta-heuristics on the same benchmark instances.