期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

批处理机调度问题的蚁群算法求解 被引量：2

Scheduling Single Batch Processing Machine Using Ant Colony Algorithm
下载PDF
导出
摘要 为了求解工件具有不同尺寸的批处理机调度问题,将蚁群算法调整为工件直接成批的调度算法,并提出了一个新的局部优化算法对蚁群算法进行改进。最后通过仿真实验将本算法与其它算法对本问题的求解进行了比较,表明该算法在求解批调度问题上有较好的性能。 An ant colony algorithm（ACO） was proposed to study the problem of minimizing makespan on a single batch processing machine with non-identical jobs sizes. ACO was used by grouping several jobs into a batch directly and the parameter settings were also discussed. A new local search algorithm was provided to improve the performance of the ACO. The computational experiment was conducted to show the improvement of ACO compared to some other algo- rithms.
作者 夏欣
机构地区 南京农业大学信息科技学院
出处 《计算机科学》 CSCD 北大核心 2013年第5期247-250,共4页 Computer Science
基金 南京农业大学青年科技创新基金项目(KJ2012018)资助
关键词 调度 蚁群算法 制造跨度 组合优化 Scheduling Ant colony algorithm Makespan Combinatorial optimization
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献9

  • 1Uzsoy R. Scheduling a single batch processing machine with non-identical job sizes[J]. International Journal of Production Research, 1994, 32(7) : 1615-1635.
  • 2Melouk S, Damodaran P, Chang P Y. Minimizing makespan for single machine batch processing with non-identical job sizes u- sing simulated annealing[J]. International Journal of Production Economics, 2004,87 (2): 141-147.
  • 3Damodaran P, Manjeshwar P K, Srihari K. Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms[J]. International Journal of Production Eco- nomics, 2006,103(2) : 882-891.
  • 4程八一,陈华平,王栓狮.优化差异工件单机批调度问题的改进蚁群算法[J].系统仿真学报,2009,21(9):2687-2690. 被引量：5
  • 5Chen H,Du B, Huang G Q, Scheduling a batch processing ma- chine with non-identical job sizes: a clustering perspective[J]. International Journal of Production Research, 2011, 49 (19) : 5755-5778.
  • 6Potts C N, Kovalyov M Y. Scheduling with batching: A review [J]. European Journal of Operational Research, 2000, 120 ( 2 ) : 228-249.
  • 7Mathirajan M, Sivakumar A I. A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor[J]. International Journal of Advanced Manufac- turing Technology, 2006,29(9/10) : 990-1001.
  • 8Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies[C]//Proceedings of the First European Conference on Artificial Life. 1991.
  • 9Dorigo M, Blum C. Ant colony optimization theory: A survey [J]. Theoretical Computer Science, 2005,344(2/3) : 243-278.

二级参考文献12

  • 1Uzsoy R. Scheduling a single batch processing machine with non-identical job sizes [J] International Journal of Production Research (S0020-7543), 1994, 32(7): 1615-1635.
  • 2Dupont L, Jolai G F. A branch and bound algorithm for minimizing mean flow time on a single batch processing machine [J]. Intemational Journal of Industrial Engineering, (S1072-4761), 1997, 4(3): 197-203.
  • 3Dupont L, Flipo D C. Minimizing the makespan on a batch machine with nonidentical job sizes: an exact procedure [J]. Computers & Operations Research (S0305-0548), 2002, 29(7): 807-819.
  • 4Sevaux M, Peres S D. Genetic algorithms to minimize the weighted number of late jobs on a single machine [J]. European Journal of Operational Research (S0377-2217), 2003, 151(2): 296-306.
  • 5Koksalan M, Keha A B. Using genetic algorithms for single machine bicriteria scheduling problems. European [J]. Journal of Operational Research (S0377-2217), 2003, 145(3): 543-556.
  • 6AH Kashan, B, Karimi, Jolai G E Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach [J]. Evolutionary Computation in Combinatorial Optimization, 2006, 3906: 335-146.
  • 7Damodaran P, Manjeshwar P K, Srihari K. Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms [J]. International Journal of Production Economics (S0925-5273), 2006, 103(2): 882-891.
  • 8Melouk S, Damodaran P, Chang P Y. Minimizing makespan for single machine batch processing with nonidentical job sizes using simulated annealing [J]. International Journal of Production Economics (S0925-5273), 2004, 87(2): 141-147.
  • 9Colorni A, Dorigo M, Maniezzo V, Trubian M. Ant system for job shop scheduling [J]. Belgian Journal of Operations Research (S0770-0512), 1994, 34(1): 39-53.
  • 10Bltun C, Sampels M. c An ant colony optimization algorithm for shop scheduling problems [J]. Journal of Mathematical Modeling and Algorithms (S1570-1166), 2004, 3(3): 285-308.

共引文献4

同被引文献27

引证文献2

二级引证文献5

计算机科学
2013年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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