A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy

2012 ◽  
Author(s):  
M. Fatih Tasgetiren ◽  
Onder Bulut ◽  
M. Murat Fadiloglu
Keyword(s):  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Scheduling Problem ◽  
Lot Scheduling ◽  
Economic Lot Scheduling Problem ◽  
Economic Lot Scheduling ◽  
Discrete Harmony Search

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