Dr. S. Jayakumar

S. Jayasankari

Abstract

In a flow shop environment, scheduling n jobs on m machines is NP-hard, and it has a prominent position in the field of production scheduling. This paper considers the scheduling of n jobs on m machines in a permutation flow shop with a makespan minimization target. The proposed solution is demonstrated in detail by giving an suitable example. Finally, the result obtained using the proposed method are compared to those obtained using a previously published method. It was found that our algorithm outperforms the other algorithms.

Keywords- Flow shop, Heuristic, Permutation, Makespan.