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 (Ctot) also minimizes total flow time (Ftot), total lateness (Ltot), average completion time (Cavg), average flow time (Favg) and average lateness (Lavg). Two approaches (Analytical and Experimental approaches) were adopted to prove this conjecture.