柔性作业车间人员配置及作业排序问题研究*

以最小化任务完成时间为目标,建立了柔性作业车间人员配置及作业排序模型,并设计了蚁群-遗传混合优化算法进行求解。首先,根据求解问题特征,设计了蚁群-遗传协调优化的算法结构。其中,蚁群算法求解资源配置,遗传算法求解既定资源配置方案下的作业排序；其次,为便于蚂蚁游历中配置任务的加工设备和操作人员,设计了一种新的蚂蚁游历地图及地图上启发式信息的计算方法和更新方式；再次,遗传算法采用基于工序优先权值的实数编码方式,并采用父子排序的精英保留策略以促进算法收敛；最后,通过两个不同规模的实例,比较其与其他算法及不同资源配置规则的运行结果,说明本算法能较好的求解柔性作业车间的人员配置及作业排序问题。

Research on operator allocation and scheduling problem for flexible job shop. Computer Engineering and Applications

In order to minimize the completion time, the model of operator allocation and job scheduling in flexible job-shop is constructed and a hybrid of ant colony and genetic algorithms is proposed based on the analysis of resource allocation, job scheduling and their relationship. Firstly, The hybrid is formulated in a form of hierarchical structure. The ant colony algorithm is performed to fulfill resource allocation, while the genetic algorithm is carried out to schedule jobs without violating the result from the cert resource allocation scheme; Secondly, in order to allocate equipment and personnel expediently with travel ants, the traveling map of ants is constructed and the calculation and update method of heuristic information in the traveling map is designed; Thirdly, real coding based on priority values of process is adopted by genetic algorithm and son-father sort policies of elitist is designed to promote convergence of the genetic algorithm; Finally, the main parameters of the hybrid is analyzed through experiments of two different size instances and comparing with the results of other algorithm and allocating resources rules, illustrate the hybrid can better solve the problems of operator allocation and jobs scheduling in flexible job-shop.