AN ALGORITHM FOR SOLVING N-JOB, M-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH OBJECTIVE OF MINIMIZING MAKESPAN

In this paper the authors investigate the problem of minimizing the Makespan using Heuristic approach. The author compared the result with the existing algorithms namely Palmer's Heuristic(a slope order index), CDS Heuristic, NEH Heuristic algorithm, Gupta heuristic, RA (rapid access) Heuristic found in the literature and it was found that our algorithm perform superior than the other algorithms found in the literature