A novel grouping harmony search algorithm for the no-wait flow shop scheduling problems with total flow time criteria

Author

Kaizhou, Gao ; Quanke, Pan ; Junqing, Li ; Yongzheng, He

Author_Institution

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

Volume

1

fYear

2010

fDate

5-7 May 2010

Firstpage

77

Lastpage

80

Abstract

This paper presents a novel grouping harmony search algorithm for solving the no-wait flow shop scheduling problems with total flow time criteria. Flow-shop scheduling problem (FSSP) is a typical NP-hard combinational optimization. Firstly, the HS optimization mechanism and 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. Thirdly, the main contribution of this study is due to the fact that harmony memory is divided into groups and groups share information reciprocally in the process of optimization. At last, simulations demonstrate the efficiency, effectiveness and robustness of harmony search algorithm for no-wait FSSP with total flow time criteria.

Keywords

computational complexity; flow shop scheduling; search problems; HS optimization mechanism; NP-hard combinational optimization; grouping harmony search algorithm; harmony search algorithm; no-wait flow shop scheduling problems; total flow time criteria; Algorithm design and analysis; Automatic control; Chemical industry; Communication system control; Computer science; Delay effects; Job shop scheduling; Processor scheduling; Routing; Scheduling algorithm; Grouping harmony; Harmony search; No-wait flow shop; total flow time;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communication Control and Automation (3CA), 2010 International Symposium on

Conference_Location

Tainan

Print_ISBN

978-1-4244-5565-2

Type

conf

DOI

10.1109/3CA.2010.5533729

Filename

5533729