摘要
本文描述了基于可变机器约束的多目标柔性Job-shop调度问题模型,并应用一种改进的遗传算法进行求解。我们采用了表示工序先后顺序及机器选择的二维编码方式,以多目标优化函数为度量,通过三种遗传操作扩展后代的多样性和算法的搜索空间。仿真结果验证了该算法能有效解决多目标优化问题。
The model of flexible job shop scheduling problem with alterable machines is described, and an improved GA scheduling approach is used to solve the problem.Two-dimensional encoding method represents the priority dispatching sequence and machines which are selected, multi-objective optimization functions are used as evaluation, and the three genetic operators can enlarge the population and search space. The effectiveness of the proposed algorithm is verified by computation results.
出处
《微计算机信息》
北大核心
2007年第33期163-165,共3页
Control & Automation
