Flowshop scheduling problem with objective of minimizing TCT

Abstract

In manufacturing industries, scheduling problems are the origin. Particularly flowshop scheduling problem occurs in time table algorithm, operatory theory and combinatorial optimization problem with the total completion time (TCT) minimizing is a herculean task to obtain near optimal solution. Researchers are interested in solving these types of problems with the objective being that TCT is quite fashionable. Comparing the solution with existing one is quite logical to arrive the conclusion which algorithm performance better than the other. The heuristic approach developed by us, Jayakumar and Vasudevan performs better compare with other algorithms found in the literature.