摘要
针对算法复杂度很高的加工时间可控单机排序问题,提出一种基于二维遗传算法求解其次优解的方法。在介绍这一问题的数学模型后,利用二维编码描述加工次序与加工时间,染色体的第一行用整数编码来表示工件加工次序,染色体第二行用实数编码来表示实际加工时间。根据问题特点定义了新的遗传操作,这样不仅容易产生优良的初始解,而且缩小了搜索范围,提高了搜索速度和精度。算例仿真研究验证了所提出算法的有效性。
The two-dimension coding genetic algorithm is presented for solving the problem with controllable processing times of the NP-hard single machine . When the mathematic model is given, the two dimension code method is proposed to describe the job sequence and actual processing time. Based on the problem＇ s character,the new operations of GA are defined. The heuristic GA not only can start with better initial populations, but also can reach the solution more precise and faster. Applying it to the exam- ple, the simulation results show that satisfactory performance is obtained.
出处
《现代制造工程》
CSCD
北大核心
2013年第8期17-21,共5页
Modern Manufacturing Engineering
基金
国家自然科学基金资助项目(70471052)
关键词
算法复杂度
加工时间可控
遗传算法
二维编码
complexity
scheduling with controllable processing times
Genetic Algorithm （GA）
two-dimension coding
