摘要
利用遗传算法,研究开发了一个用来快速生成制造系统中作业计划的调度软件,软件综合考虑了目前生产中出现的以总加工时间最短及总收益最大两种目标,分别给出了这两种目标模式下的编码、解码的详细方法及软件流程,并提出了一种解决实际约束的联合移位算子,通过一个实例说明了软件的实用性,最后还讨论了寻优软件的解的优劣性判断的问题。
A scheduling software was developed for rapid jobs planning in manufacturing system based on genetic algorithm. This software considers two targets in the production, minimal total flow time and maximal benefit, under which the detailed methods of coding, decoding, and the process of the software are presented. A new joint-moving algorithm is raised for solving practical constraints. Through an example the practicability of this soft is demonstrated. At last, the evaluation problem of solutions is also discussed.
出处
《辽宁工程技术大学学报（自然科学版）》
EI
CAS
北大核心
2005年第2期254-257,共4页
Journal of Liaoning Technical University (Natural Science)
关键词
遗传算法
作业计划
调度软件
genetic algorithm
job planning
scheduling soft
