A harmony search algorithm for hybrid flow shop scheduling with multiprocessor task problems

Author

Akkoyunlu, Mehmet Cabir ; Engin, Orhan ; Buyukozkan, Kadir

Author_Institution

Dept. of Ind. Eng., Yildiz Tech. Univ., Istanbul, Turkey

fYear

2015

fDate

27-29 May 2015

Firstpage

1

Lastpage

3

Abstract

Multiprocessor task can be stated as finding a schedule for a general graph to execute on a multiprocessor system. In this paper an efficient harmony search algorithm (HSA) is proposed to solve the hybrid flow shop scheduling with multiprocessor task problems (HFSMTP). The best values of HFS´s control parameters are determined by full factorial design. Computational results are compared with the genetic algorithm related to the HFSMTP at the literature. The result showed that the proposed HSA is effective for solving HFSMTP.

Keywords

computational complexity; flow shop scheduling; genetic algorithms; multiprocessing systems; search problems; HFS control parameter; HFSMTP; HSA; full factorial design; genetic algorithm; harmony search algorithm; hybrid flow shop scheduling with multiprocessor task problems; multiprocessor system; Genetic algorithms; Heuristic algorithms; Industrial engineering; Job shop scheduling; Processor scheduling; Search problems; Hybrid flow shop; harmony search algorithm; multiprocessor task scheduling problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Modeling, Simulation, and Applied Optimization (ICMSAO), 2015 6th International Conference on

Conference_Location

Istanbul

Type

conf

DOI

10.1109/ICMSAO.2015.7152245

Filename

7152245