1Department of Applied Mathematics & Computational Science, S.G.S. Institute of Technology & Sciences, 23-Park Road, Indore, (M.P.).
2Department of Mathematics, Faculty of Applied Sciences, TRUBA College of Engineering, Indore.
This paper considers the problem of scheduling in flow-shop by classical method and genetic algorithm method for finding an optimal sequence for njobs m-machine problem based on minimum elapsed time. The results of the tests showed that, for processing n-jobs through m-machine, genetic algorithm provide better result. Once the sequence is obtained, total elapsed time as well as the idle time of m-machines can be obtained.
Flow-shop, scheduling, genetic algorithm
