A Coevolutionary Genetic Based Scheduling Algorithm for stochastic flexible scheduling problem

Because traditional genetic algorithm has many limitations on solutions for the combined optimization problems, a coevolutionary genetic based scheduling algorithm (CGBSA) is proposed for solving the stochastic flexible scheduling problem. In CGBSA, the number of sub-population is divided by the number of working procedure. The interaction of all sub-populations is reflected by means of the definition of fitness function. Based on stochastic programming theory and stochastic simulation, a model is presented object to minimize the maximum completion time, in which the processing time is uncertainty. Compared with GA, the simulation results validate the efficiency of the proposed stochastic schedule model and algorithm.