A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

2011 ◽  
Vol 38 (4) ◽  
pp. 3252-3259 ◽  
Author(s):  
Quan-Ke Pan ◽  
P.N. Suganthan ◽  
J.J. Liang ◽  
M. Fatih Tasgetiren
Keyword(s):  
Flow Shop ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Lot Streaming ◽  
Shop Scheduling ◽  
Streaming Flow

The Lot-Streaming Flow Scheduling Shops Based on a Hybrid Discrete Harmony Search Algorithm

2011 ◽  
Vol 204-210 ◽  
pp. 563-568
Author(s):  
Hong Yan Han
Keyword(s):  
Flow Shop ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Flow Shop Scheduling ◽  
Neighborhood Search ◽  
Lot Streaming ◽  
Discrete Harmony Search ◽  
Harmony Memory ◽  
Streaming Flow

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.

No-Wait Flow Shop Scheduling Based on Discrete Harmony Search Algorithm

2014 ◽  
Vol 513-517 ◽  
pp. 1523-1526 ◽  
Author(s):  
Qiang Qiang Sun ◽  
Bin Dong
Keyword(s):  
Flow Shop ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Total Flowtime ◽  
No Wait ◽  
Discrete Harmony Search

This paper proposed a discrete harmony search algorithm, named DHS, for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. Firstly, the total flowtime is shown. Secondly, a harmony is represented as a discrete job permutation and the well-known NEH method is proposed to initialize the harmony memory. Thirdly, Extensive computational experiments are carried out based on a set of well-known benchmark instances. Computational results show the effectiveness of the DHS algorithm in solving the no-wait flow shop scheduling problem.

Sign in / Sign up

Export Citation Format

Share Document