Abstract
A new approach for solving flow shop problem is presented. The developed
and implemented system -based on genetic algorithm- formulates
the flow shop problem as u traveling salesman problem rind solves the
machine—job scheduling problem accordingly. Special selection, crossover,
and mutation operators are used within the genetic system. Results
showed fast convergence toward optimal scheduler