Single machine scheduling problem of minimizing maximum earliness and number of tardy jobs using a genetic algorithm

Single machine scheduling is of essential importance due to its practical applications and the fact that it reduces bottleneck in production lines and provides results that are useful for more complex scheduling environments. In this article, Single machine scheduling problem to minimize the number of tardy jobs and maximum earliness and no slack time is examined. The reason of applying these two criteria simultaneously is the tendency to use the JIT system that finds earlier or later production undesirable. In this study, a genetic algorithm has been proposed to solve the problem. A set of instance problems have been investigated and the results are compared with the results of genetic algorithm used in the research literature. Numerical experiments show better performance of proposed algorithm.