A NEW HEURISTIC ALGORITHM TO DETERMINE MORE THAN ONE SEQUENCE IN PERMUTATION FLOW SHOP SCHEDULING BY USING HARMONIC TRIANGLE

In this paper we present a new heuristic algorithm to minimize the total completion time (Makespan) in permutation flow shop scheduling of ‘n' jobs and ‘m' machines by using harmonic triangle. In any shop floor, the major responsibility of process planning engineer is to process the ‘n' number of jobs in ‘m' machines within the due date. It can be achieved by optimal sequence of processing the jobs. Many classical heuristics procedures were proposed starting from Johnson's algorithm to find optimal or near optimal sequence for job completion.In this research, an attempt is made to propose a new heuristic by using Harmonic triangle. Also, the new heuristic is compared with fewother popular heuristics like CDS, Palmer, RA and Gupta Heuristics and the efficacy of new heuristic is analysed.