Hybridize optimization Algorithms for the Single Machine Total Tardiness Problem

Various optimization heuristics are investigated and applied ina number of areas in the field of single machine scheduling problems. We present efficient heuristic optimization algorithms (Genetic Algorithm and Simulated Annealing) for single machine scheduling problems with and without release times. The increasingly important issue of parallelization is considered with an example implementation being provided inthe case of single machine problem is shown. The results show that these algorithms were able to produce high quality optimization, especially for w jTj .