E.O. Oyetunji  , A.E. Oluleye  , 
    The Total Completion Time: An Important Performance Measure in Scheduling,
    International Journal of Soft Computing,
    Volume 3,Issue 6,
    2008,
    Pages 407-411,
    ISSN 1816-9503,
    ijscomp.2008.407.411,
    (https://makhillpublications.co/view-article.php?doi=ijscomp.2008.407.411)
    Abstract: Given the problem of scheduling n jobs with release dates on a single machine, we prove that any solution method that minimizes the total completion time (C<SUB>tot</SUB>) also minimizes total flow time (F<SUB>tot</SUB>), total lateness (L<SUB>tot</SUB>), average completion time (C<SUB>avg</SUB>), average flow time (F<SUB>avg</SUB>) and average lateness (L<SUB>avg</SUB>). Two approaches (Analytical and Experimental approaches) were adopted to prove this conjecture.
    Keywords: Scheduling;Heuristics;total completion time;single-machine;release date