摘要
放宽了对于生产调度问题的一些假设,首先根据任务的优先级安排生产,其次令一批工件的某道工序可以由多台设备组合加工;利用图论理论,建立了基于设备组合的数学模型;基于蚁群算法的思想,给出了求解方法。最后通过实例进行了验证。
The paper gives up some hypothesis of the job shop scheduling problem.Firstly,the working procedure is planed following the priority of the tasks.Secondly,one working procedure of the task can be done by the combination of workpieces not only by one workpiece.Finally,a model based on the graph theory is introduced,an algorithm based on the ant colony algorithm is proposed and a case study is used to illustrate the feasibility and effectiveness of the proposed method.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第11期26-29,共4页
Computer Engineering and Applications
基金
国家自然科学基金重大项目No.70531020
国家863/CIMS主题资助项目No.2007AA04Z151
新世纪优秀人才支持计划资助No.NCET-06-0377~~
关键词
车间调度问题
设备组合加工
图论
job shop scheduling
combination of workpieces
graph theory
