A harmony search algorithm for the no-wait flow shop optimization scheduling

This paper proposes an effective method for the no-wait flow-shop scheduling optimization based on harmony search (HS). Flow-shop scheduling problem (FSSP) is a typical NP-hard combinational optimization. The purpose of this paper is the total flow time criterion. Firstly, the HS-based optimization mechanism and framework is presented. Secondly, the total flow time is calculated by a novel method. Thirdly, 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. At last, simulations and comparisons demonstrate the efficiency, effectiveness and robustness of harmony search algorithm for no-wait FSSP.