蚁群算法求解工件尺寸不同的单机批处理问题  

Single Batch-Processing Machine with Non-Identical Job Sizes of Ant Colony Algorithm Solution Workpiece

作　　者：李端明[1] 程八一[2] 

机构地区：[1]西南科技大学经济管理学院,四川绵阳621010 [2]合肥工业大学管理学院,安徽合肥230009

出　　处：《兵工自动化》2010年第6期34-36,40,共4页Ordnance Industry Automation

基　　金：国家自然科学基金项目"二维多机调度若干问题研究"(项目批准号:70671096)的资助

摘　　要：针对工件尺寸不同的单机批处理调度问题,提出以制造跨度为优化目标的蚁群算法。通过人工蚁对图进行遍历,形成工件序列;同时采用启发式规则对所得结果进行分批处理,得到问题的解;最后对不同复杂度的算例进行仿真。结果表明,蚁群算法在解决工件尺寸不同的单机批处理问题时,具备优异的性能。但对于不同工件尺寸的多机批处理问题,还有待进一步研究。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 job sizes deserves further research in the future.

关 键 词：生产调度 批处理机 蚁群算法 组合优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]