Evolutionary algorithms approach to solution of a class of scheduling problems

Evolutionary algorithms approach to solution of the jobshop scheduling problems (JSP) is studied. Different from the existing genetic algorithm approach to JSP, the approach proposed in this paper is based upon the mixed integer model of the JSP, and casts the JSP as a mixed integer linear or nonlinear programming (MINLP) problem. With genetic algorithm and evolution strategy, the procedures for solution of MINLP problems are presented respectively. Constraints of the MINLP problems are dealt with easily by using the penalty function method and the Deb approach. At the end of the paper, computer simulations for a numerical example are made, and the results show that the proposed approach is effective.