By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Gao Kaizhou ; School of computer science, Liaocheng University, Liaocheng, 252059, China ; Pan Quanke ; Li Junqing ; He Yongzheng

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.

Published in:

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

Date of Conference:

5-7 May 2010