MULTIPROCESSOR SCHEDULING USING ANT COLONY OPTIMIZATION WHERE JOB VALUES ARE THE POWER FUNCTION OF COMPLETION TIME
暂无分享,去创建一个
[1] T. C. Edwin Cheng,et al. Parallel machine scheduling to minimize the sum of quadratic completion times , 2004 .
[2] M. Dorigo,et al. 1 Positive Feedback as a Search Strategy , 1991 .
[3] J. Deneubourg,et al. The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.
[4] Adam Janiak,et al. Minimizing maximum lateness under linear deterioration , 2000, Eur. J. Oper. Res..
[5] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[6] Adam Janiak,et al. A scheduling problem with job values given as a power function of their completion times , 2009, Eur. J. Oper. Res..
[7] T. C. Edwin Cheng,et al. Single machine batch scheduling with deadlines and resource dependent processing times , 1995, Oper. Res. Lett..
[8] 임소형. [Special Issue 01] 대한민국 최고과학자의 몰락 , 2006 .
[9] Grzegorz Rozenberg,et al. The many facets of natural computing , 2008, Commun. ACM.
[10] J. Deneubourg,et al. Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.
[11] Jean,et al. The Computer and the Brain , 1989, Annals of the History of Computing.
[13] Phen Chiak See,et al. A new minimum pheromone threshold strategy (MPTS) for max-min ant system , 2009, Appl. Soft Comput..
[14] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.