Abstract: In practical operation planning, there is a class of problems, that is: giving a batch of targets, the single-target destroying schemes and launching fields, it must select related scheme for every target and assign launching field for it, according to constrains of weapons, units and fields, etc. The diculty of these problems mostly comes from the complexity of the relations among targets, destroying schemes, operation units and launching fields. There are several destroying schemes for every target; the weapons involved in destroying schemes belong to different operation units; and every operation unit can only fire at several limited launching fields. This paper aimed at solving this class of problems. A detailed model of these problems was proposed, and a corresponding genetic algorithm was designed. The eciency of the algorithm was presented by experiments.