2021
DOI: 10.3233/jifs-210764
|View full text |Cite
|
Sign up to set email alerts
|

Diversified teaching-learning-based optimization for fuzzy two-stage hybrid flow shop scheduling with setup time

Abstract: Distributed scheduling has attracted much attention in recent years; however, distributed scheduling problem with uncertainty is seldom considered. In this study, fuzzy distributed two-stage hybrid flow shop scheduling problem (FDTHFSP) with sequence-dependent setup time is addressed and a diversified teaching-learning-based optimization (DTLBO) algorithm is applied to optimize fuzzy makespan and total agreement index. In DTLBO, multiple classes are constructed and categorized into two types according to class… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 45 publications
0
5
0
Order By: Relevance
“…TLBO usually has only one class. A multi-class TLBO is considered to improve the performance of TLBO for scheduling problems [32,38]. These algorithms have more than two classes and the number of classes is the algorithm parameter.…”
Section: Atlbo For Ehfsp With Additional Resourcesmentioning
confidence: 99%
See 3 more Smart Citations
“…TLBO usually has only one class. A multi-class TLBO is considered to improve the performance of TLBO for scheduling problems [32,38]. These algorithms have more than two classes and the number of classes is the algorithm parameter.…”
Section: Atlbo For Ehfsp With Additional Resourcesmentioning
confidence: 99%
“…A flowchart of ATLBO is shown in Figure 2 . Unlike the existing TLBOs [32,38], ATLBO just uses two classes. After two classes are formed, a teacher phase with self-learning and teaching is executed on multiple teachers.…”
Section: End Whilementioning
confidence: 99%
See 2 more Smart Citations
“…For this problem with the optimization objective of minimizing maximum completion time, the common methods are iterative greed algorithm 44 , 60 , shuffled frog leaping algorithm 47 , hybrid brain storm optimization algorithm 49 , 54 , artificial bee colony algorithm 55 – 57 , and cooperative memetic algorithm 62 etc. For the problem with multi-objective optimization, the methods used are genetic algorithm 59 , variable neighborhood search 48 , shuffled frog leaping algorithm 45 , 46 , 51 , 64 , teaching-learning-based optimization 52 , cooperative coevolution algorithm 63 , 65 , decomposition-based multi-objective optimization 50 , iterated greedy algorithm 61 and other evolutionary algorithms 53 .…”
Section: Introductionmentioning
confidence: 99%