.png){kind=icon}
Return
Genetic algorithms for flowshop scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/0360-8352(96)00053-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we apply a genetic algorithm to flowshop scheduling problems and examine two hybridizations of the genetic algorithm with other search algorithms. First we examine various genetic operators to design a genetic algorithm for the flowshop scheduling problem with an objective of minimizing the makespan. By computer simulations, we show that the two-point crossover and the shift change mutation are effective for this problem. Next we compare the genetic algorithm with other search algorithms such as local search, taboo search and simulated annealing. Computer simulations show that the genetic algorithm is a bit inferior to the others. In order to improve the performance of the genetic algorithm, we examine the hybridization of the genetic algorithms. We show two hybrid genetic algorithms: genetic local search and genetic simulated annealing. Their high performance is demonstrated by computer simulations. Copyright (C) 1996 Elsevier Science Ltd
Keywords:
SHOP SEQUENCING PROBLEM
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave no more
no more