2021
DOI: 10.3934/jimo.2019122
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem

Abstract: The job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. The problem has captured the interest of a significant number of researchers, but no efficient solution algorithm has been found yet for solving it to optimality in polynomial time. In this paper, a hybrid social-spider optimization algorithm with differential mutation operator is presented to solve the job-shop scheduling problem. To improve the exploration capabilities of the social spider optimization algor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 39 publications
0
8
0
Order By: Relevance
“…Table 5 shows a comparative analysis with four more heuristics on four instances of different sizes. The four heuristics are PSO [ 37 ], IGA [ 38 ], DE [ 39 ] and SSO-DM [ 18 ]. The table gives the statistical results, i.e., the best, worst, mean and standard deviation (Std.…”
Section: Experiments and Comparisonmentioning
confidence: 99%
See 3 more Smart Citations
“…Table 5 shows a comparative analysis with four more heuristics on four instances of different sizes. The four heuristics are PSO [ 37 ], IGA [ 38 ], DE [ 39 ] and SSO-DM [ 18 ]. The table gives the statistical results, i.e., the best, worst, mean and standard deviation (Std.…”
Section: Experiments and Comparisonmentioning
confidence: 99%
“…Except for instance YN4, the proposed algorithm found the best known solutions for the remaining three instances. The results of the comparative heuristics are from Zhou et al [ 18 ]. Figs 8 – 11 show the box plots of these five algorithms on the four instances.…”
Section: Experiments and Comparisonmentioning
confidence: 99%
See 2 more Smart Citations
“…Abdel-Kader [17] combines standard PSO and GA to solve JSSP. Zhou [18] fuses the social spider optimization algorithm and the differential evolutionary based mutation operator for solving the JSSP. Peng et al [19] proposed a MAGATS algorithm that combines multi-agent GA and TS to solve JSSP.…”
Section: Introductionmentioning
confidence: 99%