Many industrial applications deals with the problem of improper utilization of given resources and scheduling of jobs. This project titled, “A Flow shop Scheduling Using Genetic Algorithm”, explains the scheduling of jobs in a flow shop to minimize the makespan using a non-traditional technique, Genetic Algorithm.

                          A machine shop with ‘n’ number of jobs and ‘m’ number of machines is considered to calculate the makespan. Many sequence schedules are generated and many iterations are performed. The schedules are generated using random number generation program. The makespan calculation is based on the given processing time and batch quantity, for each schedule generated. The schedule with the minimum makespan is selected and considered as the optimum result after performing many iterations. Genetic algorithm is used for this flow shop problem due to following reasons

  • One of the fast and best converging techniques when the search space is large.
  • It provides better solutions when compared to other search procedures.

                         Genetic algorithm is implemented using C language since numbers of iterations are more. One could calculate the makespan even though the number of possible sequence schedules is (n!)^m within few minutes. In this project work, the number possible sequences are (10!)^2. An optimum result of minimum makespan is obtained at 20th iteration for a case study problem.

Tags :
Your rating: None Average: 3.5 (2 votes)

Posted by

Tue, 12/04/2011 - 08:14