scholarly journals Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling

2014 ◽  
Vol 289 ◽  
pp. 76-90 ◽  
Author(s):  
K.Z. Gao ◽  
P.N. Suganthan ◽  
Q.K. Pan ◽  
T.J. Chua ◽  
T.X. Cai ◽  
...  
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling ◽  
Multi Objective ◽  
Discrete Harmony Search

scholarly journals A FJSSP Method Based on Dynamic Multi-Objective Squirrel Search Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Yanjiao Wang ◽  
Jieru Han
Keyword(s):  
Mathematical Model ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Multi Objective ◽  
The Mathematical Model

This paper comprehensively analyzes the characteristics of flexible job shop scheduling problem (FJSSP), takes the dynamic factors in the actual scheduling process such as the arrival and departure of jobs, the breakdown and recovery of machines into account at the same time, and establishes a new dynamic multi-objective mathematical model. Take the Squirrel Search Algorithm (SSA) as the core evolution strategy, and combine the multi-objective framework and the dynamic processing technology to solve the established mathematical model. Experimental results show that the mathematical model proposed in this paper can solve the flexible job shop scheduling problem effectively. Compared with other mathematical models, the mathematical model established in this paper can keep better balance between the efficiency and stability.

Discrete Harmony Search Algorithm for the Disassembly Scheduling Remanufacturing Engineering

2012 ◽  
Vol 236-237 ◽  
pp. 169-174
Author(s):  
K.Z. Gao ◽  
P.N. Suganthan ◽  
T.J. Chua
Keyword(s):  
Manufacturing Industry ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Flexible Job Shop Scheduling ◽  
Simulation Experiments ◽  
Traditional Manufacturing ◽  
Discrete Harmony Search

Remanufacturing is a growing branch of the traditional manufacturing industry. In this study, a discrete harmony search (DHS) algorithm is proposed for thedisassembly scheduling of products in the remanufacturing engineering.Firstly, the disassembly scheduling of products is regarded as flexible job shop scheduling problem. Then, the harmony search algorithm is discretized for the disassembly scheduling problem.Finally, simulation experiments are carried out to test the proposed discrete harmony search algorithm. The results and comparisons show the effectiveness of the proposed DHS algorithm in solving the disassemblyscheduling problem in remanufacturing engineering.

Sign in / Sign up

Export Citation Format

Share Document