الفهرس 
CHAPTER 1: A Survey on OptimizationOnly 14 pages are availabe for public view
 |  | from | 182 |  |  |
| | | from | 182 | | |
Abstract
Optimization problems are essentially research topic in many science and engineering disciplines and there are still many open questions in this area. Job shop scheduling problem (JSSP) is a branch of production scheduling, which is among the hardest combinatorial optimization problem.
In this thesis, we present a new hybrid optimization algorithm for solving one of the most important optimization problems (nonlinear optimization problems(. The hybrid algorithm is a combination between genetic algorithm and chaos theory.
In addition, hybrid genetic algorithm is presented to solve real optimization problems (job shop scheduling problem). Our algorithm is a combination between genetic algorithm and local search. Our approach is tested on a set of standard instances taken from the literature. The computation results have validated the effectiveness of the proposed.