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

Elucidating multiprocessors flow shop scheduling with dependent setup times using a twin particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…They investigated the master-slave approaches and developed several different PPSO algorithms exploring the advantages of enhanced neighborhood topologies implemented by communication strategies in multiprocessor architectures. Yu [210] proposed the incorporation of a local search heuristic into the basic PSO algorithm. The new, hybrid metaheuristic was called twin PSO (TPSO).…”
Section: Parallel Implementationmentioning
confidence: 99%
See 1 more Smart Citation
“…They investigated the master-slave approaches and developed several different PPSO algorithms exploring the advantages of enhanced neighborhood topologies implemented by communication strategies in multiprocessor architectures. Yu [210] proposed the incorporation of a local search heuristic into the basic PSO algorithm. The new, hybrid metaheuristic was called twin PSO (TPSO).…”
Section: Parallel Implementationmentioning
confidence: 99%
“…Waintraub et al [209] and Yu [210] GPU Hung and Wang [211], Rymut et al [212], Kumar et al [213], Awwad et al [214], and Chen et al [215] Cloud Liu et al [216], Xu and You [217], Ramezani et al [218], Govindarajan et al [219], and Ramezani et al [220] Table 5: Application areas of PSO algorithm.…”
Section: Trends Of Applicationsmentioning
confidence: 99%
“…At present, many algorithms are used to solve flowline scheduling problems, such as genetic algorithm [37], particle swarm optimization algorithm [38], simulated annealing algorithm [39] and so on. The whale optimization algorithm (WOA) is a new meta heuristic optimization algorithm which simulates the hunting behavior of humpback whales by Mirjalili in 2016 [40].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Almost all of the authors studying HFSMT proposed metaheuristics, such as a particle swarm optimization by Tseng et al (Tseng and Liao, 2008), a heuristic coupled with two local search methods by Ying et al (Ying and Lin, 2009), a memetic algorithm that combines GA and constraint programming by Jouglet et al (2009), a parallel greedy approach by Kahraman et al (2010), a simulated annealing including three different decoding methods by Wang et al (2011), PSO algorithm by Chou (2013), a shuffled frog-leaping algorithm for HFSMT by Xu et al (2013), a new discrepancy search called climbing depth-bounded adjacent discrepancy search by Lahimer et al (2013), a new hybrid metaheuristic called “twin particle swarm optimization” algorithm by Yu (2014) and an improved cuckoo search metaheuristic algorithm by Marichelvam et al (2014), were presented for the HFSMT problem. Engin et al (2011) proposed a GA for HFSMT and they stated that their results suggested that the computational performance of GA depends on the factors of initial population, reproduction, crossover and mutation operators and coefficients.…”
Section: Literature Reviewmentioning
confidence: 99%