National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Application of genetic algorithm for production scheduling of engineering company
Stariat, Jiří ; Skočdopolová, Veronika (advisor) ; Zouhar, Jan (referee)
This thesis is engaged in scheduling problem, his special types and methods of solving. Scheduling problem is a common operations research problem, which ranks among combinatorial problems. The aim of the scheduling problem is to assign certain activities and resources to individual time moments. Scheduling problem is NP-complete problem. Its computational complexity is thus so high, that there is currently no known algorithm that precisely solve its any instance in polynomial time. Is therefore used for its solution heuristics and metaheuristcs. In this thesis is described in detail metaheuristics of genetic algorithm. Application of genetic algorithm for production scheduling of specific engineering company is the main objective of this thesis.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.