Genetic local search algorithms for single machine scheduling problems with release time

Abstract

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 2ri +ti rule proposed by Liu and MacCathy (1991) outperform ERT and WSPT. © 2006 International Federation for Information Processing.