Single machine scheduling problems with release time are the prototypes for other complicated scheduling systems. Genetic local search algorithms are proposed to minimize total weighted completion time. Numerical experiments to evaluate the three embedding local search techniques are done. The results indicate that the 2r _i+t _i rule proposed by Liu and MacCathy (1991) outperform ERT and WSPT.