{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:27:20Z","timestamp":1725492440157},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540724315"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72432-2_64","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T04:32:12Z","timestamp":1190176332000},"page":"628-637","source":"Crossref","is-referenced-by-count":1,"title":["An Intelligent Hybrid Algorithm for Job-Shop Scheduling Based on Particle Swarm Optimization and Artificial Immune System"],"prefix":"10.1007","author":[{"given":"Ge","family":"Hong-Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du","family":"Wen-Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"64_CR1","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/S0377-2217(02)00136-4","volume":"144","author":"R. Heilmann","year":"2003","unstructured":"Heilmann, R.: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research\u00a0144(2), 348\u2013365 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"64_CR2","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1057\/palgrave.jors.2601421","volume":"53","author":"T. Lorigeon","year":"2002","unstructured":"Lorigeon, T.: A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint. Journal of the Operational Research Society\u00a053(11), 1239\u20131246 (2002)","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"64_CR3","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1023\/B:JIMS.0000034116.50789.df","volume":"15","author":"Y.B. Canbolat","year":"2004","unstructured":"Canbolat, Y.B., Gundogar, E.: Fuzzy priority rule for job shop scheduling. Journal of intelligent manufacturing\u00a015(4), 527\u2013533 (2004)","journal-title":"Journal of intelligent manufacturing"},{"issue":"12","key":"64_CR4","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1016\/S0305-0548(03)00243-0","volume":"31","author":"W.Q. Huang","year":"2004","unstructured":"Huang, W.Q., Yin, A.H.: An improved shifting bottleneck procedure for the job shop scheduling problem. Computers & Operations Research\u00a031(12), 2093\u20132110 (2004)","journal-title":"Computers & Operations Research"},{"issue":"4","key":"64_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1023\/B:JIMS.0000034106.86434.46","volume":"15","author":"F. Geyik","year":"2004","unstructured":"Geyik, F., Cedimoglu, I.H.: The strategies and parameters of tabu search for job-shop scheduling. Journal of intelligent manufacturing\u00a015(4), 439\u2013448 (2004)","journal-title":"Journal of intelligent manufacturing"},{"key":"64_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/11504894_71","volume-title":"Innovations in Applied Artificial Intelligence","author":"C. Fayad","year":"2005","unstructured":"Fayad, C., Petrovic, S.: A fuzzy genetic algorithm for real-world job shop scheduling. In: Ali, M., Esposito, F. (eds.) IEA\/AIE 2005. LNCS (LNAI), vol.\u00a03533, pp. 524\u2013533. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"64_CR7","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/s00170-004-2492-x","volume":"29","author":"R.K. Suresh","year":"2006","unstructured":"Suresh, R.K., Mohanasundaram, K.M.: Pareto archived simulated annealing for job shop scheduling with multiple objectives. International Journal of Advanced Manufacturing Technology\u00a029(1-2), 184\u2013196 (2006)","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45192-1_1","volume-title":"Artificial Immune Systems","author":"C.A.C. Coello","year":"2003","unstructured":"Coello, C.A.C., Rivera, D.C., Cortes, N.C.: Use of an artificial immune system for job shop scheduling. In: Timmis, J., Bentley, P.J., Hart, E. (eds.) ICARIS 2003. LNCS, vol.\u00a02787, pp. 1\u201310. Springer, Heidelberg (2003)"},{"key":"64_CR9","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume-title":"Proceedings of the IEEE International Conference on Neural Networks, vol. 4","author":"J. Kennedy","year":"1995","unstructured":"Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, Perth, Australia, pp. 1942\u20131948. IEEE Service Center, Piscataway (1995)"},{"issue":"11","key":"64_CR10","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operations Research Society\u00a041(11), 1069\u20131072 (1990)","journal-title":"Journal of the Operations Research Society"},{"issue":"1","key":"64_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"J.F. Goncalves","year":"2005","unstructured":"Goncalves, J.F., Mendes, J.J.D.M., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research\u00a0167(1), 77\u201395 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"64_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/B:APIN.0000027769.48098.91","volume":"21","author":"B.M. Ombuki","year":"2004","unstructured":"Ombuki, B.M., Ventresca, M.: Local search genetic algorithms for the job shop scheduling problem. Applied Intelligence\u00a021(1), 99\u2013109 (2004)","journal-title":"Applied Intelligence"},{"issue":"4","key":"64_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R.M. Aiex","year":"2003","unstructured":"Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing\u00a029(4), 393\u2013430 (2003)","journal-title":"Parallel Computing"},{"key":"64_CR14","first-page":"59","volume-title":"Essays and Surveys in Metaheuristics","author":"S. Binato","year":"2001","unstructured":"Binato, S., et al.: A GRASP for Job Shop Scheduling. In: Essays and Surveys in Metaheuristics, pp. 59\u201380. Kluwer Academic Publishers, Boston (2001)"}],"container-title":["Advances in Soft Computing","Analysis and Design of Intelligent Systems using Soft Computing Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72432-2_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:13:25Z","timestamp":1619518405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72432-2_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540724315"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72432-2_64","relation":{},"subject":[]}}