TY  - JOUR
T1  - The Total Completion Time: An Important Performance Measure in Scheduling
AU - , E.O. Oyetunji AU - , A.E. Oluleye 
JO  - International Journal of Soft Computing
VL  - 3
IS  - 6
SP  - 407
EP  - 411
PY  - 2008
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2008.407.411
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2008.407.411
KW  - Scheduling
KW  -Heuristics
KW  -total completion time
KW  -single-machine
KW  -release date
AB  - 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.
ER  -