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.