Genetic local search algorithm for minimizing the total completion time in single machine scheduling problem with release dates and precedence constraints

In this work we investigate the single machine scheduling problem with release dates and precedence constraints for minimizing the sum of completion times. To solve this problem approximately, we propose three constructive heuristics as well as a genetic local search algorithm. Computational results show that the proposed genetic local search algorithm yields near-optimal solutions and provides interesting results.