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

Ying K-C ()
Additional contact information
Ying K-C: Huafan University

Journal of the Operational Research Society, 2009, vol. 60, issue 6, 810-817

Abstract: 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.

Keywords: hybrid flowshop; multiprocessor task scheduling; iterated greedy heuristic (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602625 Abstract (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:pal:jorsoc:v:60:y:2009:i:6:d:10.1057_palgrave.jors.2602625

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2602625

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().