An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks

An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks

0.00 Avg rating0 Votes
Article ID: iaor200968974
Country: United Kingdom
Volume: 60
Issue: 6
Start Page Number: 810
End Page Number: 817
Publication Date: Jun 2009
Journal: Journal of the Operational Research Society
Authors:
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.