Return to Article Details Application of an Efficient Genetic Algorithm for Solving n×m Flow Shop Scheduling Problem Comparing it with Branch and Bound Algorithm and Tabu Search Algorithm Download Download PDF