Application of Improved Pseudo-Parallel Genetic Algorithm for Job-Shop Scheduling Problem

An improved pseudo-parallel genetic algorithm genetic algorithm based on JSSP is proposed,which combines improved algorithms with simple genetic algorithms parallel,ensures the variety and avoids early convergence.The algorithms improve some genetic operator,apply iterative-crossover,multi-parent produced multi-children and make the good gene-segment combination.The best individual sequences is also introduced to avoid missing the optimum value.The simulation results of sample MT6 6 and MT10 10 prove that the IPPGA is superior to SGA.