科研之友
微信
新浪微博
Facebook
分享链接
摘要
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. Journal of the Operational Research Society (2009) 60, 810-817. doi: 10.1057/palgrave.jors.2602625 Published online 28 May 2008
- 出版日期2009-6
