The Lot-Streaming Flow Scheduling Shops Based on a Hybrid Discrete Harmony Search Algorithm
To solve the lot-streaming flow shop scheduling problem with the objective to minimize the total weighted earliness and tardiness, a hybrid discrete harmony search (HDHS) algorithm is proposed in this paper. Firstly, an effective harmony memory initialization approach is presented,an initial solution in harmony memory is generated by means of the famous NEH heuristic. Secondly, the HDHS algorithm utilizes an effective improvisation mechanism to generate new harmonies represented by job permutations. Lastly, the insert neighborhood search and swap operator are designed and embedded in the algorithm to enhance the local exploitation.Experimental results demonstrate the effectiveness of the proposed HDHS algorithms.
Helen Zhang, Gang Shen and David Jin
H. Y. Han "The Lot-Streaming Flow Scheduling Shops Based on a Hybrid Discrete Harmony Search Algorithm", Advanced Materials Research, Vols. 204-210, pp. 563-568, 2011