.png){kind=icon}
.png){kind=icon}
Return
A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00205-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we confront a family of scheduling problems by means of genetic algorithms: the job shop scheduling problem with bottlenecks. Our main contribution is a strategy to introduce specific knowledge into the initial population. This strategy exploits a probabilistic-based heuristic method that was designed to guide a conventional backtracking search. We report experimental results on two benchmarks, the first one includes a set of small problems and is taken from the literature. The second includes medium and large size problems and is proposed by our own. The experimental results show that the performance of the genetic algorithm clearly augments when the initial population is seeded with heuristic chromosomes, the improvement being more and more appreciable as long as the size of the problem instance increases. Moreover premature convergence which sometimes appears when randomness is limited in any way in a genetic algorithm is not observed. (C) 2002 Elsevier Science B.V. All rights reserved.
Keywords:
genetic algorithms
heuristics
optimization
scheduling theory
job shop scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available