DocumentCode
3600054
Title
Heuristics for a general scheduling problem
Author
Gutierrez, Celia
Author_Institution
Dept. of Eng., Instituto Tecnologico de Monterrey, Mexico
Volume
1
fYear
2004
Firstpage
660
Abstract
The following paper describes research on the design of heuristic repairers that have been applied to the output of an artificial genetic algorithm (GA) in a scheduling problem. The GA produces a coarse solution where constraints are not fulfilled at 100% effectiveness. So, heuristic techniques provide a refinement of the solution with one heuristic repairer for each kind of constraint which is not fulfilled.
Keywords
constraint handling; genetic algorithms; heuristic programming; manufacturing processes; scheduling; artificial genetic algorithm; heuristic repairers; heuristic techniques; manufacturing processes; scheduling problem; system operations; technological constraints; Algorithm design and analysis; Design engineering; Expert systems; Genetic algorithms; Genetic engineering; Iron; Job shop scheduling; Path planning; Production; Refining;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2004. CEC2004. Congress on
Print_ISBN
0-7803-8515-2
Type
conf
DOI
10.1109/CEC.2004.1330921
Filename
1330921
Link To Document