Open AccessThe average degree-distance index of graph operations
Author(s) -
Sathiya Shanthi R,
R Meganathan,
S Jayakuma,
R. Vijayaragavan
Publication year - 2022
Publication title -
journal of computational mathematics
Language(s) - English
Resource type - Journals
ISSN - 2456-8686
DOI - 10.26524/cm120
Subject(s) - vertex (graph theory) , combinatorics , mathematics , graph , set (abstract data type) , transformation (genetics) , algorithm , discrete mathematics , computer science , programming language , biochemistry , chemistry , gene
This paper studies a 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 make span 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.