{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:06:11Z","timestamp":1725537971993},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040191"},{"type":"electronic","value":"9783642040207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04020-7_26","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:43:19Z","timestamp":1252939399000},"page":"242-251","source":"Crossref","is-referenced-by-count":5,"title":["Combined Discrete Particle Swarm Optimization and Simulated Annealing for Grid Computing Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Ruey-Maw","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Der-Fang","family":"Shiau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Tang","family":"Lo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compeleceng.2006.05.003","volume":"33","author":"L.T. Lee","year":"2007","unstructured":"Lee, L.T., Tao, D.F., Tsao, C.: An Adaptive Scheme for Predicting the Usage of Grid Resources. Comput. Electr. Eng.\u00a033(1), 1\u201311 (2007)","journal-title":"Comput. Electr. Eng."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0141-9331(02)00053-4","volume":"26","author":"A. Salman","year":"2002","unstructured":"Salman, A., Ahmad, I., Al-Madani, S.: Particle Swarm Optimization for Task Assignment Problem. Microprocessors and Microsystems\u00a026, 363\u2013371 (2002)","journal-title":"Microprocessors and Microsystems"},{"issue":"6","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"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.\u00a021(6), 1087\u20131092 (1953)","journal-title":"J. of Chem. Phys."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhard, R.C.: Particle Swarm Optimization. In: Proceedings IEEE International Conference on Neural Networks, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1016\/j.eswa.2008.08.054"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"D.Y. Sha","year":"2006","unstructured":"Sha, D.Y., Hsu, C.Y.: A Hybrid Particle Swarm Optimization for Job Shop Scheduling Problem. Comput. Ind. Eng.\u00a051, 791\u2013808 (2006)","journal-title":"Comput. Ind. Eng."},{"key":"26_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2003-6","volume-title":"Assignment Problems in Parallel and Distributed Computing","author":"S.H. Bokhari","year":"1987","unstructured":"Bokhari, S.H.: Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers, Boston (1987)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/71.210815","volume":"4","author":"V. Chaudhary","year":"1993","unstructured":"Chaudhary, V., Aggarwal, J.K.: A Generalized Scheme for Mapping Parallel Algorithms. IEEE Trans. Parallel Distrib. Syst.\u00a04, 328\u2013346 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/158439.158908","volume":"25","author":"M.G. Norman","year":"1993","unstructured":"Norman, M.G., Thanisch, P.: Models of Machines and Computation for Mapping in Multicomputers. ACM Comput. Surv.\u00a025, 263\u2013302 (1993)","journal-title":"ACM Comput. Surv."},{"issue":"10","key":"26_CR11","doi-asserted-by":"publisher","first-page":"3099","DOI":"10.1016\/j.cor.2005.11.017","volume":"34","author":"C.J. Liao","year":"2007","unstructured":"Liao, C.J., Tseng, C.T., Luarn, P.: A Discrete Version of Particle Swarm Optimization for Flowshop Scheduling Problems. Comput. Oper. Res.\u00a034(10), 3099\u20133111 (2007)","journal-title":"Comput. Oper. Res."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"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\u20134109 (1997)","DOI":"10.1109\/ICSMC.1997.637339"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.cie.2008.05.007","volume":"56","author":"A.H. Kashan","year":"2009","unstructured":"Kashan, A.H., Karimi, B.: A Discrete Particle Swarm Optimization Algorithm for Scheduling Parallel Machines. Comput. Ind. Eng.\u00a056(1), 216\u2013223 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1016\/j.cor.2006.07.005","volume":"35","author":"A.H. Kashan","year":"2008","unstructured":"Kashan, A.H., Karimi, B., Jenabi, M.: A Hybrid Genetic Heuristic for Scheduling Parallel Batch Processing Machines with Arbitrary Job Sizes. Comput. Oper. Res.\u00a035, 1084\u20131098 (2008)","journal-title":"Comput. Oper. Res."},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s00170-005-0188-5","volume":"31","author":"W.C. Lee","year":"2006","unstructured":"Lee, W.C., Wu, C.C., Chen, P.: A Simulated Annealing Approach to Makespan Minimization on Identical Parallel Machines. Int. J. Adv. Manuf. Technol.\u00a031, 328\u2013334 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"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\u20131587 (2002)","DOI":"10.1109\/CEC.2002.1004478"}],"container-title":["Lecture Notes in Computer Science","Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04020-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T06:54:12Z","timestamp":1619765652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04020-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040191","9783642040207"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04020-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}