Combined discrete particle swarm optimization and simulated annealing for grid computing scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5755 LNAI, Issue , 2009, Pages 242-251

  Chen, Ruey Maw ^a   Shiau, Der Fang ^b   Lo, Shih Tang ^c  

^a NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b FOOYIN UNIVERSITY   (Taiwan)

^c KUN SHAN UNIVERSITY   (Taiwan)

Author keywords

Grid Computing; Meta heuristic; Particle Swarm Optimization; Simulated annealing; Task Assignment

Indexed keywords

COMMUNICATION COST; COMPUTING COST; DISCRETE PARTICLE SWARM OPTIMIZATION; DISCRETE SPACES; DISTRIBUTED SYSTEMS; GRID SCHEDULING; META-HEURISTIC; ORIGINAL PARTICLE SWARM OPTIMIZATION; SCHEDULING PROBLEM; SIMULATION RESULT; SOLUTION SPACE; TASK ASSIGNMENT;

ANNEALING; COMPUTER SCIENCE; GRID COMPUTING; HEURISTIC METHODS; INTELLIGENT COMPUTING; PARTICLE SWARM OPTIMIZATION (PSO);

SIMULATED ANNEALING;

EID: 70350376012     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04020-7_26     Document Type: Conference Paper

References (16)

1. Lee, L.T., Tao, D.F., Tsao, C.: An Adaptive Scheme for Predicting the Usage of Grid Resources. Comput. Electr. Eng. 33(1), 1-11 (2007)
2. Salman, A., Ahmad, I., Al-Madani, S.: Particle Swarm Optimization for Task Assignment Problem. Microprocessors and Microsystems 26, 363-371 (2002)
3. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of State Calculations by Fast Computing Machines. J. of Chem. Phys. 21(6), 1087-1092 (1953)
4. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671-680 (1983)
5. Kennedy, J., Eberhard, R.C.: Particle Swarm Optimization. In: Proceedings IEEE International Conference on Neural Networks, pp. 1942-1948 (1995)
6. Kuo, I.H., Horng, S.J., Kao, T.W., Lin, T.L., Lee, C.L., Terano, T., Pan, Y.: An Efficient Flow-shop Scheduling Algorithm based on a Hybrid Particle Swarm Optimization Model. Expert Syst. Appl. (2009) doi:10.1016/j.eswa.2008.08. 054
7. Sha, D.Y., Hsu, C.Y.: A Hybrid Particle Swarm Optimization for Job Shop Scheduling Problem. Comput. Ind. Eng. 51, 791-808 (2006)
8. Bokhari, S.H.: Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers, Boston (1987)
9. Chaudhary, V., Aggarwal, J.K.: A Generalized Scheme for Mapping Parallel Algorithms. IEEE Trans. Parallel Distrib. Syst. 4, 328-346 (1993)
10. Norman, M.G., Thanisch, P.: Models of Machines and Computation for Mapping in Multicomputers. ACM Comput. Surv. 25, 263-302 (1993)
11. Liao, C.J., Tseng, C.T., Luarn, P.: A Discrete Version of Particle Swarm Optimization for Flowshop Scheduling Problems. Comput. Oper. Res. 34(10), 3099-3111 (2007)
12. Kennedy, J., Eberhard, R.C.: A Discrete Binary Version of the Particle Swarm Algorithm. In: Proceedings of IEEE Conference on Systems, Man, and Cybernetics, Piscataway, NJ, pp. 4104-4109 (1997)
13. Kashan, A.H., Karimi, B.: A Discrete Particle Swarm Optimization Algorithm for Scheduling Parallel Machines. Comput. Ind. Eng. 56(1), 216-223 (2009)
14. Kashan, A.H., Karimi, B., Jenabi, M.: A Hybrid Genetic Heuristic for Scheduling Parallel Batch Processing Machines with Arbitrary Job Sizes. Comput. Oper. Res. 35, 1084-1098 (2008)
15. Lee, W.C., Wu, C.C., Chen, P.: A Simulated Annealing Approach to Makespan Minimization on Identical Parallel Machines. Int. J. Adv. Manuf. Technol. 31, 328-334 (2006)
16. Laskari, E.C., Parsopoulos, K.E., Vrahatis, M.N.: Particle Swarm Optimization for Integer Programming. In: Proceedings of the IEEE Congress on Evolutionary Computation, Honolulu, pp. 1582-1587 (2002)