R Sathiya Shanthi
Assistant Professor of Mathematics, School of Agricultural Sciences, Dhanalakshmi Srinivasan University, Trichy, (TN)
R Meganathan
Professor of Mathematics, School of Engineering and Technology, Dhanalakshmi Srinivasan University, Trichy, (TN)
S Jayakumar
Associate Professor and Head of Mathematics, Arignar Anna Govt. Arts College, Cheyyar, (TN)
Abstract
This paper studies scheduling problem of two-machine flow shop (FSSP). Minimization of maximum completion time always leads to the improvement of all the relevant measures of flow lines. Minimization of total completion time also much important in the production environment. In our earlier work we had developed two new heuristics based on Johnson’s rule for solving FSSP with makespan objective which reduces the total completion time criteria also. In this paper, we have extended the investigation of our algorithms to a objective which combines both the objectives. Through case studies, we showed that one of our algorithms performed well than the other two
Keywords- Scheduling problem, flow shop, makespan, total completion time, production scheduling.