Open AccessSolving flow shop scheduling problems with the objective of minimizing TCT when tie occurs
Author(s) -
Sathiya Shanthi R,
R Meganathan,
S. Jayakumar,
R. Vijayaragavan
Publication year - 2021
Publication title -
journal of computational mathematics
Language(s) - English
Resource type - Journals
ISSN - 2456-8686
DOI - 10.26524/cm102
Subject(s) - job shop scheduling , flow shop scheduling , computer science , mathematical optimization , minification , scheduling (production processes) , mathematics , schedule , operating system
Scheduling process arises naturally upon availability of resources through a systematic approach in which prior planning and decisions should be made. Two machine flow shop scheduling problem (FSSP) was solved by Johnson in the mid of 1954 with makespan minimization as objective. Earlier we proposed two algorithms for the makespan objective; in this paper we intend to investigate the same algorithms for the objective of Total Completion Time of all the jobs (TCT). Experimental results had shown that one of our algorithms gives better results than the other two when the machine order is reversed.