Hybrid heuristics based on harmony search to minimize total flow time in no-wait flow shop

Author

Gao, K.Z. ; Li, H. ; Pan, Q.K. ; Li, J.Q. ; Liang, J.J.

Author_Institution

Coll. of Comput. Sci., Liaocheng Univ., Liaocheng, China

fYear

2010

fDate

26-28 May 2010

Firstpage

1184

Lastpage

1188

Abstract

This paper proposes an effective harmony search (HS) based heuristics method for the no-wait flow-shop scheduling optimization. The purpose of this paper is to minimize the total flow time. Firstly, the basic HS optimization mechanism, FSSP is presented and the total flow time is calculated by a novel method. Secondly, a largest-order-value rule is used to transform harmony in harmony memory from real vectors to job sequence so that the harmony search can be applied for FSSP. Improvising rule of new harmony is expatiated and high effective algorithm parameters are set for optimization object. Thirdly, HS and Insert-and interchange-based neighbor search, is proposed to solve the FSSP. At last, simulations and comparisons demonstrate the efficiency, effectiveness and robustness of harmony search algorithm for no-wait FSSP.

Keywords

flow shop scheduling; minimisation; search problems; FSSP; harmony search; hybrid heuristics; insert-based neighbor search; interchange-based neighbor search; largest-order-value rule; no-wait flow-shop scheduling optimization; total flow time minimization; Chemical industry; Computer science; Educational institutions; Genetic algorithms; Job shop scheduling; Machinery production industries; Optimization methods; Particle swarm optimization; Processor scheduling; Robustness; Harmony search; flow shop; no-wait; total flow time;

fLanguage

English

Publisher

ieee

Conference_Titel

Control and Decision Conference (CCDC), 2010 Chinese

Conference_Location

Xuzhou

Print_ISBN

978-1-4244-5181-4

Electronic_ISBN

978-1-4244-5182-1

Type

conf

DOI

10.1109/CCDC.2010.5498155

Filename

5498155