Solving machine process sequencing problems with due date windows by an integer coded partheno-genetic algorithm

The machine process sequencing problem with due date windows is NP-hard in the strong sense, and so traditional algorithms usually are not effective. In this paper, we successfully solved a machine process sequencing problem with due date windows by an integer coded partheno-genetic algorithm, and demonstrate that the complexity of the algorithm is such that its use is feasible. Numerical experiments show the effectiveness of the proposed method.