Application Job-Shop Scheduling Problems Based on Improved Genetic Algorithm to Engineering Equipment's Rush-Repair in Battlefield
Circuits, Communications and Systems, Pacific-Asia Conference on (2009)
May 16, 2009 to May 17, 2009
Engineering equipment’s rush-repairs in battlefield optimal assignment model was established. Combining the features of Job-shop scheduling problems, described the complexity of this problem. In order to find global optimal results efficiently, traditional GAs were improved and used for study of this problem. Though genetic algorithm, as an effective global search method, had been used in many engineering problems, it had the disadvantages of slow convergence and poor stability in practical engineering. In order to overcome these problems, an improved genetic algorithm was proposed in terms of creation of the initial population, genetic operators, etc. At the end, the steps to solve the optimal model were put forward. With this model we had obtained ideal results. This shows that the method can offer a scientific and effective support for a decision maker in command automation of the engineering equipment’s rush-repairs in battlefield.
engineering equipment; rush-repairs in battlefield; job-shop scheduling; genetic algorithm
Q. Zhang and W. Wang, "Application Job-Shop Scheduling Problems Based on Improved Genetic Algorithm to Engineering Equipment's Rush-Repair in Battlefield," 2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS 2009)(PACCS), Chengdu, 2009, pp. 314-317.