R Durgadevi

Dr. S Jayakumar

K Moorthi

Abstract

Scheduling problem as its origin in manufacturing industries. Particularly flow shop scheduling problem occurs in the timetable algorithm, operatory theory and combinatorial optimization problem to minimize the TCT (Total Completion Time) is a herculean task to obtain a near-optimal solution. Researchers are interested in solving these types of problems with the objective are TCT is quite fashionable. This paper examines the permutation FSSP for TCT. Also, Permutation FSSP has wide field applications in operation theory, combinatorial algorithms, and operations management. In this examination, we have fostered an algorithm that beats the algorithm accessible in the literature. However, the issue of three or more machines is recognized to be NP, resulting in near-optimal solutions, the method is simple and elegant to the given problem

Keywords- Flow shop scheduling, Johnson’s technique, Gupta’s method, heuristic, TCT.