摘要
对NP—Hard的加工时间可控单机排序问题提出一种启发式遗传算法求解其次优解。在介绍该问题数学模型后，利用二维编码描述加工次序与加工时间，染色体的第一行用整数编码来表示工件加工次序，染色体第二行用实数编码表示实际加工时间。根据启发式知识定义了新的交叉与变异操作，这样不仅容易产生优良的初始解，而且缩小了搜索范围，提高了搜索速度和精度。算例仿真研究验证了提出算法的有效性。
The heuristic Genetic algorithm is presented for solving the problem of processing time control of the NP-hard single machine. The mathematic model is introduced. The two dimensional coding method is proposed to describe the job time sequence and actual processing time. Based on heuristic knowledge, the new crossover and mutation operations of GA are de- fined. The heuristic GA not only can start with better initial solusion, but also can make the solution more precise and faster. The simulation results show that the algorithm is effective.
出处
《现代电子技术》
2011年第20期85-89,共5页
Modern Electronics Technique
基金
基金项目：国家自然科学基金资助项目（60421002
70471052）
