2023
DOI: 10.1109/tase.2022.3151648
|View full text |Cite
|
Sign up to set email alerts
|

Improved Meta-Heuristics for Solving Distributed Lot-Streaming Permutation Flow Shop Scheduling Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(3 citation statements)
references
References 56 publications
0
1
0
Order By: Relevance
“…This indicator is to rank all algorithms. Friedman test [36] is a very powerful nonparametric statistical test, which is often used to compare the differences among algorithms [37], [38]. In this paper, the mean results of the applied algorithms are subjected to the Friedman test, and the Friedman mean rank (FMR) is recorded.…”
Section: Results and Comparisonsmentioning
confidence: 99%
“…This indicator is to rank all algorithms. Friedman test [36] is a very powerful nonparametric statistical test, which is often used to compare the differences among algorithms [37], [38]. In this paper, the mean results of the applied algorithms are subjected to the Friedman test, and the Friedman mean rank (FMR) is recorded.…”
Section: Results and Comparisonsmentioning
confidence: 99%
“…If a match is identified, then an alert message flash indicating duplication attempts. However, if a match is not found, it is identified as a new category and hence a new entry is added to the database [5].…”
Section: Category Managementmentioning
confidence: 99%
“…Wu et al [12] focused on the robotic cell scheduling problem with batchprocessing machines, and a green schedule algorithm and a multi-objective differential evolution algorithm are proposed to optimize the makespan and energy consumption of the batch-processing machines simultaneously. Pan et al [13] executed five meta-heuristics are executed to solve the distributed batch flow alignment process shop scheduling problem. Qin et al [14] considered the limited waiting time between batch and discrete processors to develop a learning-based scheduling method through custom genetic programming.…”
Section: Low-carbon Manufacturing Scheduling Optimizationmentioning
confidence: 99%