Computer Science ›› 2013, Vol. 40 ›› Issue (5): 247-250.
Previous Articles Next Articles
XIA Xin
| [1] Uzsoy R.Scheduling a single batch processing machine withnon-identical job sizes[J]．International Journal of Production Research,1994,32(7):1615-1635 [2] Melouk 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 [3] Damodaran 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,2006,103(2):882-891 [4] 程八一,陈华平,王栓狮．优化差异工件单机批调度问题的改进蚁群算法[J]．系统仿真学报,2009(9):2687-2695 [5] Chen H,Du B,Huang G Q．Scheduling a batch processing machine with non-identical job sizes:a clustering perspective[J]．International Journal of Production Research,2011,49(19):5755-5778 [6] Potts C N,Kovalyov M Y．Scheduling with batching:A review[J]． European Journal of Operational Research,2000,120(2):228-249 [7] Mathirajan M,Sivakumar A I．A literature review,classificationand simple meta-analysis on scheduling of batch processors in semiconductor[J]．International Journal of Advanced Manufacturing Technology,2006,29(9/10):990-1001 [8] Colorni A,Dorigo M,Maniezzo V．Distributed optimization by ant colonies[C]∥Proceedings of the First European Conference on Artificial Life．1991 [9] Dorigo M,Blum C．Ant colony optimization theory:A survey[J]．Theoretical Computer Science,2005,344(2/3):243-278 |
| No related articles found! |
|
||
Home