A heuristic algorithm for scheduling in a flow shop environment to minimize makespan

In this paper an attempt has been made to develop a heuristic algorithm, based on the reduced weightage of machines at each stage to generate different combination of ‘m-1’ sequences.