Solving Flow Shop Scheduling Problem With The Objective Of Minimizing Makespan And Total Completion Time

FSSP (Flow Shop Scheduling Problem) as its origin in 1950’s. In FSSP they are mainly related to important objectives such as makespan and total completion time (TCT) of flow lines. Johnson was the first author to investigate these kind of problems. He solved two machine n job problems first and obtained the reasonably good schedule. For more than 2 machine problems, Palmer (1965) solving n job m machine problem to achieve reasonably good schedule using makespan objective and later CDS (1970), Gupta (1971), Dannenbring (1977) and so many researchers have generalized makespan objective. In this paper, we developed two algorithms which perform superior to the other problems found in the literature. Analyses of results show that the algorithm with SPT gives better outcomes as compared to LPT when the machine order is reversed.