2016
DOI: 10.1504/ijbic.2016.079572
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimise total flow time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 48 publications
0
6
0
Order By: Relevance
“…The Firefly Algorithm (FA) is based on the communication behaviour of tropical fireflies and the idealized behaviour of the flashing patterns. FA uses the following three idealized rules (22)(23) to build the mathematical model of the algorithm:…”
Section: Results and Discussion Firefly Algorithm (Fa)mentioning
confidence: 99%
“…The Firefly Algorithm (FA) is based on the communication behaviour of tropical fireflies and the idealized behaviour of the flashing patterns. FA uses the following three idealized rules (22)(23) to build the mathematical model of the algorithm:…”
Section: Results and Discussion Firefly Algorithm (Fa)mentioning
confidence: 99%
“…The luminescence of the tropical fireflies acts as the inspiration for the firefly algorithm, a swarm intelligence, metaheuristic optimisation technique. 41 43 Firefly algorithm depends on three idealised rules: (1) Since fireflies are all unisex, they can be attracted to one another regardless of sex. (2) The attractiveness reduces with increasing distance between the fireflies and is closely correlated to the intensity of the light of the fireflies.…”
Section: Methodsmentioning
confidence: 99%
“…For the hybrid methods, discrete firefly algorithm usually focuses on an extensive search for the solution space while the local search algorithm is generally used to reschedule the results for a speedy and accuracy convergence. Marichelvam et al (2016) [113] proposed a hybrid discrete firefly algorithm (HDFA) to solve the FSSPs to minimize the total flow time.…”
Section: (12) Combination Algorithms and Recent Studies Based On Famentioning
confidence: 99%