遗传算法求解一类排序问题

Solution to the Scheduling Problems

考虑一类分段恶化单机问题,得到了最优解的性质,根据这些性质设计了一种求近似最优解的遗传算法。通过分支定界法对小规模算例的验证表明,本遗传算法获得精确解的比例是高的,由此认为所给遗传算法是很有效的。

In this paper, a kind of step-deteriorating single machine scheduling problem is considered. The properties of its optimal solution are discussed and a kind of GA implement is accordingly made. The proposed GA algorithm is verified effective by comparing with the Branch and Bound method on small sized numerical experiments.