A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem

Abstract

In this paper, we have proposed a hybrid permutation-coded steady-state genetic algorithm for a single machine scheduling problem with earliness and tardiness costs and no machine idle time. The steady-state genetic algorithm generates schedules, which are further improved by successive applications of an adjacent pairwise interchange procedure. We have compared our approach against the best approaches reported in the literature. Computational results show the effectiveness of our approach, since it obtained better quality solutions in shorter time. © 2010 World Scientific Publishing Co. & Operational Research Society of Singapore.