2022
DOI: 10.1016/j.asoc.2022.109235
|View full text |Cite
|
Sign up to set email alerts
|

A shuffled cellular evolutionary grey wolf optimizer for flexible job shop scheduling problem with tree-structure job precedence constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(1 citation statement)
references
References 67 publications
0
1
0
Order By: Relevance
“…The multiple resource-constrained job shop scheduling problem constraints are widely regarded as a typical NP-Hard problem. In tackling this formidable challenge, researchers frequently resort to employing metaheuristic algorithms, including the genetic algorithm [30,31], grey wolf optimization algorithms [32] and particle swarm algorithms [33], differential evolution algorithm [34]. Specifically, the FJSP-MRST presents a comprehensive problem that encompasses mold changeover time, machine, and mold resource constraints, thus manifesting as an evident NP-hard problem.…”
Section: Multi-objective Differential Evolutionary Algorithmmentioning
confidence: 99%
“…The multiple resource-constrained job shop scheduling problem constraints are widely regarded as a typical NP-Hard problem. In tackling this formidable challenge, researchers frequently resort to employing metaheuristic algorithms, including the genetic algorithm [30,31], grey wolf optimization algorithms [32] and particle swarm algorithms [33], differential evolution algorithm [34]. Specifically, the FJSP-MRST presents a comprehensive problem that encompasses mold changeover time, machine, and mold resource constraints, thus manifesting as an evident NP-hard problem.…”
Section: Multi-objective Differential Evolutionary Algorithmmentioning
confidence: 99%