期刊文献+

一种差异工件单机批调度问题的蚁群优化算法 被引量:21

Minimizing makespan on a single batch processing machine with non-identical job sizes using ant colony optimization
在线阅读 下载PDF
导出
摘要 由于在利用蚁群算法构建差异工件(即工件有尺寸差异)单机批调度问题的解时,批的加工时间是不确定的,从而不能类似于经典调度问题的蚁群算法把批加工时间的倒数作为蚁群算法中的启发式信息,引入批的利用率和批的负载均衡率作为蚁群算法中的启发式信息,提出了JACO(ant colony optimization based a job sequence)和BACO(ant colony optimization baseda batch sequence)两种蚁群优化算法.在算法JACO中,解的编码为工件序列,它对应着用BF(best fit)分批规则生成的调度方案,信息素代表工件间的排列顺序;在算法BACO中,解的编码为批序列,信息素代表工件间的批相关性,由此信息素通过中间信息素量来构造相应的解,并引入特定的局部优化策略,提高了算法的搜索效率.实验表明,与以往文献中的SA(simula-ted annealing)、GA(genetic algorithm)算法以及FFLPT(first-fit longest processing time)、BFLPT(best-fit longest processing time)启发式规则相比,算法JACO和BACO明显优于它们,且BACO算法比JACO算法效果更好. In this paper, two ant colony optimization(ACO) algorithms are proposed to minimize makespan for scheduling jobs with non-identical sizes on a single batch processing machine. Compared with the traditional ACO algorithm, we design new heuristic information based on utilization ratio and load balance ratio of a batch for this problem. In the first algorithm named JACO( ant colony optimization based a job sequence), the solu- tion is coded as a job sequence which is corresponding to a solution of the problem based on BBF( Batch Best Fit) heuristic, and whose pheromone trail is associated with the sequence of jobs. In the second algorithm named BACO( ant colony optimization based a batch sequence), the solution is coded as a batch sequence which represents a solution of the problem. Its pheromone trail is associated with the extent that jobs are scheduled into the same batch. Computational results show that JACO and BACO significantly outperform other four algorithms addressed in literatures, which are SA (simulated annealing), GA (genetic algorithm), FFLPT (first-fit longest processing time) and BFLPT(best-fit longest processing time). Furthermore, BACO is better than JACO. These results show that BACO is an effective and efficient method for solving scheduling problems to minimize makespan on a single batch processing machine with non-identical job sizes.
出处 《管理科学学报》 CSSCI 北大核心 2009年第6期72-82,共11页 Journal of Management Sciences in China
基金 国家自然科学基金资助项目:(70671096) 国家杰出青年基金(B类)资助项目(70629002)
关键词 调度 批处理机 蚁群优化算法 组合优化 scheduling batch processing machines ant colony optimization combinatorial optimization
  • 相关文献

参考文献22

  • 1Uzsoy R. A single batch processing machine with non-identical job sizes[ J]. International Journal of Production Research, 1994, 32(7) : 1615--1635.
  • 2Jolai G F, Dupont L. Minimizing mean flow time criteria on a single batch processing machine with non-identical job sizes [ J ]. International Journal of Production Economics, 1998, 55 (3) : 273--280.
  • 3Coffman E G, Garey M R, Johnson D S. Approximation algorithms for bin-packing- an updated survey [ A ]. In: Algorithm Design for Computer System Design[ M]. Austria: Springer-Verlag, 1984. 49--106.
  • 4Zhang G C, Cai X Q, Lee C Y, et al. Minimizing makespan on a single batch processing machine with non-identical job sizes [ J ]. Naval Research Logistics, 2001,48 ( 3 ): 226--247.
  • 5Dupont L, Jolai G F. Minimizing makespan on a single batch processing machine with non-identical job sizes[ J]. European Journal of Automation (JESA), 1998, 32: 431-440.
  • 6Dupont L, Dhaenens F C. Minimizing the makespan on a batch machine with nonidentical job sizes:An exact procedure[ J ]. Computers & Operations Research, 2002, 29 (7) : 807--819.
  • 7Melouk S, Damodaran P, Chang P Y. Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing[ J ]. International Journal of Production Economics, 2004, 87 (2) : 141--147.
  • 8Damodaran P, Kumar M P, Srihari K. Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms[ J]. International Journal of Production Economics, 2006, 103 (2) : 882--891.
  • 9Colorni A, Dorigo M, Maniezzo V, et al. Distributed Optimization by Ant Colonies [ C ]. Proceeding of the 1 st European Conference on Artificial Life, 1991. 134--142.
  • 10肖人彬,陶振武.群集智能研究进展[J].管理科学学报,2007,10(3):80-96. 被引量:33

二级参考文献193

共引文献188

同被引文献286

引证文献21

二级引证文献71

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部