An efficient heuristic approach to the scheduling of jobs in a flowshop

Abstract Three heuristic algorithms for flowshop scheduling with the objective of minimizing total flowtime are presented in this paper. Since the flowshop scheduling problem has been found to be an NP-complete problem, the development of heuristic algorithms that guarantee fairly accurate solutions becomes necessary. The proposed algorithms are found to give consistently near-optimal solutions and fare better than the existing methods.