Genetic algorithm for single machine scheduling with general early-tardy penalty weights

It is in accordance with just-in-time (JIT) philosophy to penalize early/tardy jobs. An optimal method genetic-based is presented to solve single machine scheduling problem with general early-tardy penalty weights in the paper. A new heuristic crossover operator is proposed for searching optimal sequences. On different scale of scheduling problems, lots of comparative experiments were carried out and the results manifested the method effectiveness.