.png){kind=icon}
.png){kind=icon}
Return
A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2017.09.028.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a discrete Water Wave Optimization algorithm (DWWO) is proposed to solve the no-wait flowshop scheduling problem (NWFSP) with respect to the makespan criterion. Inspired by the shallow water wave theory, the original Water Wave Optimization (WWO) is constructed for global optimization problems with propagation, refraction and breaking operators. The operators to adapt to the combinatorial optimization problems are redefined. A dynamic iterated greedy algorithm with a changing removing size is employed as the propagation operator to enhance the exploration ability. In refraction operator, a crossover strategy is employed by DWWO to avoid the algorithm falling into local optima. To improve the exploitation ability of local search, an insertion-based local search scheme which is utilized as breaking operator, is applied to search for a better solution around the current optimal solution. A ruling out inferior solution operator is also introduced to improve the convergence speed. The global convergence performance of the DWWO is analyzed with the Markov model. In addition, the computational results based on well-known benchmarks and statistical performance comparisons are presented. Experimental results demonstrate the effectiveness and efficiency of the proposed DWWO algorithm for solving NWFSP. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Water Wave Optimization (WWO)
Iterated greedy algorithm
No-wait flow shop scheduling problem
Makespan
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W
Organization
View more organizations