@article{MAKHILLIJSC20083620949,
    title = {The Total Completion Time: An Important Performance Measure in Scheduling},
    journal = {International Journal of Soft Computing},
    volume = {3},
    number = {6},
    pages = {407-411},
    year = {2008},
    issn = {1816-9503},
    doi = {ijscomp.2008.407.411},
    url = {https://makhillpublications.co/view-article.php?issn=1816-9503&doi=ijscomp.2008.407.411},
    author = {E.O. Oyetunji and},
    keywords = {Scheduling,Heuristics,total completion time,single-machine,release date},
    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.}
    }