2008
DOI: 10.1080/00207540600665893
|View full text |Cite
|
Sign up to set email alerts
|

A genetic algorithm for solving the economic lot scheduling problem in flow shops

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 44 publications
0
5
0
Order By: Relevance
“…The priority order for each chromosome during the evolution is based on its fitness function value, which is set to be the prediction accuracy of machine learning. Referencing Huang and Yao’s [ 25 ] elitism strategy, this study adopted the roulette wheel mechanism to select chromosomes for reproduction in the HGA. It directly copied 10% of the chromosomes with the best fitness values to the next generation.…”
Section: Methodsmentioning
confidence: 99%
“…The priority order for each chromosome during the evolution is based on its fitness function value, which is set to be the prediction accuracy of machine learning. Referencing Huang and Yao’s [ 25 ] elitism strategy, this study adopted the roulette wheel mechanism to select chromosomes for reproduction in the HGA. It directly copied 10% of the chromosomes with the best fitness values to the next generation.…”
Section: Methodsmentioning
confidence: 99%
“…From solution point of view, several heuristics were devised to address the flow shop problem [25]. Moreover, the computational complexity of FSSPs results in the application of metaheuristic algorithms such as genetic algorithm [7,11], particle swarm optimization [29], immune algorithm [35], ant colony system (ACS), tabu search [33]. A comprehensive literature review has been provided by Gupta [6] for the FSSPs over last five decades.…”
Section: Related Work On Fsspmentioning
confidence: 99%
“…Ouenniche and Boctor (2001a, b) developed two heuristics to solve the flow shop version of the ELSP using two different basic period approaches (namely the two‐group approach and power‐of‐two approach, respectively). Huang and Yao (2007, 2008) developed another two algorithms and compared the algorithms to Ouenniche and Boctor studies (2001a, b). Huang and Yao (2007) modified Ouenniche and Boctor's heuristics (2001b) with the objective to achieve evenly loaded assignment, and Huang and Yao (2008) applied a GA to take peak loading into consideration so that its performance is benchmarked with the two Ouenniche and Boctor studies (2001a, b).…”
Section: Key Research Themesmentioning
confidence: 99%
“…Huang and Yao (2007, 2008) developed another two algorithms and compared the algorithms to Ouenniche and Boctor studies (2001a, b). Huang and Yao (2007) modified Ouenniche and Boctor's heuristics (2001b) with the objective to achieve evenly loaded assignment, and Huang and Yao (2008) applied a GA to take peak loading into consideration so that its performance is benchmarked with the two Ouenniche and Boctor studies (2001a, b). Akrami et al (2006) and Jenabi et al (2007) presented another two studies utilizing computational intelligence techniques (GA, simulation‐annealing and tabu search) to solve the ELSP in a flow shop setting.…”
Section: Key Research Themesmentioning
confidence: 99%
See 1 more Smart Citation