首页 | 本学科首页   官方微博 | 高级检索  
     

蚁群算法求解工件尺寸不同的单机批处理问题
引用本文:李端明,程八一.蚁群算法求解工件尺寸不同的单机批处理问题[J].兵工自动化,2010,29(6):34-36.
作者姓名:李端明  程八一
作者单位:西南科技大学,经济管理学院,四川,绵阳,621010;合肥工业大学,管理学院,安徽,合肥,230009
基金项目:受国家自然科学基金项目"二维多机调度若干问题研究" 
摘    要:针对工件尺寸不同的单机批处理调度问题,提出以制造跨度为优化目标的蚁群算法。通过人工蚁对图进行遍历,形成工件序列;同时采用启发式规则对所得结果进行分批处理,得到问题的解;最后对不同复杂度的算例进行仿真。结果表明,蚁群算法在解决工件尺寸不同的单机批处理问题时,具备优异的性能。但对于不同工件尺寸的多机批处理问题,还有待进一步研究。

关 键 词:生产调度  批处理机  蚁群算法  组合优化
收稿时间:2010/8/1 0:00:00

Single Batch-Processing Machine with Non-Identical Job Sizes of Ant Colony Algorithm Solution Workpiece
LI Duan-ming,CHENG Ba-yi.Single Batch-Processing Machine with Non-Identical Job Sizes of Ant Colony Algorithm Solution Workpiece[J].Ordnance Industry Automation,2010,29(6):34-36.
Authors:LI Duan-ming  CHENG Ba-yi
Affiliation:LI Duan-ming1,CHENG Ba-yi2(1.School of Economics & Management,Southwest University of Science & Technology,Mianyang 621010,China,2.School of Management,Hefei University of Technology,Hefei 230009,China)
Abstract:Aiming at the single batch-processing machine with non-identical job sizes,an ant colony algorithm is proposed to make span.First,artificial ants are used to search the paths in the model to get a sequence of jobs and then heuristics are adopted to assign the jobs into batches,which form solutions of the problem.In the simulation part,different levels of instances are taken and the results show that the proposed algorithm is efficient in solving the problem.The scheduling of multi-machine with non-identical...
Keywords:Production scheduling  Batch-processing machine  Ant colony algorithm  Combinatorial optimization  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《兵工自动化》浏览原始摘要信息
点击此处可从《兵工自动化》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号