A genetic algorithm approach for solving flow shop problem

الملخص EN

An w." approach for solving flow shop problem is presented .

The devel¬oped and implemented system -based on genetic algorithm- formulates the flow shop problem as a traveling salesman problem and .*solve> the machine -job scheduling; problem accordingly.

Special selection , crossover .

and mutation operators are used within the generic system.

Results showed fast convergence toward optimal .schedule