An Efficient Flow Shop Scheduling Problem With Makespan Objective

Scheduling ‘n’ job in ‘m’ machine is a tedious task for the Research scholar to solve this type of problem. Flow shop scheduling has its origin in the manufacturing industries in the early 1954. In this paper, we have developed an algorithm with the objective is to minimize the total elapsed time (makespan). Examples are illustrated to demonstrate the proposed approach in detail. Finally, the result obtained under the proposed method is compared with the existing methods available in the literature. It is found that our algorithm performs better than the existing algorithm and the result have been incorporated in this article.