{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:34:51Z","timestamp":1759667691613,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253372"},{"type":"electronic","value":"9783540319962"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31996-2_23","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T21:17:28Z","timestamp":1270070248000},"page":"246-259","source":"Crossref","is-referenced-by-count":51,"title":["A New Hybrid GA\/SA Algorithm for the Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Chaoyong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Peigen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yunqing","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Shuxia","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","first-page":"136","volume-title":"Proceedings of the International Conference on Genetic Algorithms and their Applications","author":"L. Davis","year":"1985","unstructured":"Davis, L.: Job shop scheduling with genetic algorithms. In: Proceedings of the International Conference on Genetic Algorithms and their Applications, pp. 136\u2013149. Lawrence Erl-baum, Hillsdale (1985)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C. Bierwirth","year":"1995","unstructured":"Bierwirth, C.: A generalized permutation approach to job shop scheduling with genetic al-gorithms. OR Spektrum\u00a017, 87\u201392 (1995)","journal-title":"OR Spektrum"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","volume":"22","author":"F.D. Croce","year":"1995","unstructured":"Croce, F.D., Tadei, R., Volta, G.: A genetic algorithm for the job shop problem. Computers & Operations Research\u00a022(1), 15\u201324 (1995)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.V. Laarhoven","year":"1992","unstructured":"Laarhoven, P.V., Aarts, E., Lenstra, J.K.: Job shop scheduling by simulated annealing. Operations Research\u00a040(1), 113\u2013125 (1992)","journal-title":"Operations Research"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E.H.L. Aarts","year":"1994","unstructured":"Aarts, E.H.L., van Laarhoven, P.J.M., Lenstra, J.K., Ulder, N.L.J.: A computational study of local search algorithms for Job Shop Scheduling. ORSA Journal on Computing\u00a06, 118\u2013125 (1994)","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"23_CR6","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"E.D. Taillard","year":"1994","unstructured":"Taillard, E.D.: Parallel taboo search techniques for the job-shop scheduling problem. ORSA J. on Comput.\u00a06(2), 108\u2013117 (1994)","journal-title":"ORSA J. on Comput."},{"issue":"6","key":"23_CR7","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science\u00a042(6), 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A.S. Jain","year":"1999","unstructured":"Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. Euro-pean Journal of Operational Research\u00a0113, 390\u2013434 (1999)","journal-title":"Euro-pean Journal of Operational Research"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research\u00a093, 1\u201333 (1996)","journal-title":"European Journal of Operational Research"},{"key":"23_CR10","unstructured":"DeJong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. Dissertation Abstracts International 36(10), 5140B(University Microfilms No.76-9381), Ph.D. Thesis, University of Michigan, Ann Arbor (1975)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8191(94)00071-H","volume":"21","author":"S.W. Mahfoud","year":"1995","unstructured":"Mahfoud, S.W., Goldberg, D.E.: Parallel Recombinative Simulated Annealing:A Genetic Algorithm. Parallel Computing\u00a021, 1\u201328 (1995)","journal-title":"Parallel Computing"},{"issue":"11","key":"23_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0895-7177(92)90108-W","volume":"16","author":"L. Ingber","year":"1992","unstructured":"Ingber, L., Rosen, B.: Genetic algorithms and very fast simulated reannealing: a comparison. Mathematical Computer Modeling\u00a016(11), 87\u2013100 (1992)","journal-title":"Mathematical Computer Modeling"},{"key":"23_CR13","unstructured":"Brown, D.E., Huntley, C.L., Spillane, A.R.: A Parallel Genetic Heuristic for the Quadratic Assignment Problem. In: Proceedings of the Third International Conference on Genetic Algorithms, Fairfax, VA, pp. 406\u2013415 (1989)"},{"key":"23_CR14","unstructured":"Lin, F.T., Kao, C.Y., Hsu, C.C.: Incorporating Genetic Algorithms into Simulated Annealing. In: Proceeding of the Fourth International Symposium on Artificial Intelligence, pp. 290\u2013297 (1991)"},{"key":"23_CR15","first-page":"445","volume":"4","author":"D.E. Goldberg","year":"1990","unstructured":"Goldberg, D.E.: A note on Boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing. Complex Systems\u00a04, 445\u2013460 (1990)","journal-title":"Complex Systems"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Gen, M., Tsujimura, Y., Kubota, E.: Solving Job-Shop Scheduling Problems by Genetic Algorithm. In: Proceedings of the 1995 IEEE International Conference on Systems, Man, and Cybernetics. Institute of Electrical and Electronics Engineers, Vancouver, pp. 1577\u20131582 (1995)","DOI":"10.1109\/ICSMC.1994.400072"},{"key":"23_CR17","unstructured":"Shi, G.Y., Iima, H., Sannomiya, N.: A new encoding scheme for Job Shop problems by Genetic Algorithm. In: Proceedings of the 35th Conference on Decision and Control, Kobe, Japan, pp. 4395\u20134400 (1996)"},{"issue":"9","key":"23_CR18","first-page":"83","volume":"30","author":"R. Cheng","year":"1996","unstructured":"Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms \u2013 I. Representation. Computers and Industrial Engineering\u00a030(9), 83\u201397 (1996)","journal-title":"Computers and Industrial Engineering"},{"key":"23_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)"},{"key":"23_CR20","unstructured":"Gon\u00e7alves, J.F.: A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem. AT&T Labs Research Technical Report TD-5EAL6J (September 2002)"},{"key":"23_CR21","unstructured":"Kobayashi, S., Ono, I., Yamamura, M.: An Efficient Genetic Algorithm for Job Shop Scheduling Problems. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 506\u2013511 (1995)"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","volume":"113","author":"M. Kolonko","year":"1999","unstructured":"Kolonko, M.: Some new results on simulated annealing applied to the job shop scheduling problem. European Journal of Operational Research\u00a0113, 123\u2013136 (1999)","journal-title":"European Journal of Operational Research"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0377-2217(99)00158-7","volume":"120","author":"F. Pezzella","year":"2000","unstructured":"Pezzella, F., Merelli, E.: A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research\u00a0120, 297\u2013310 (2000)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31996-2_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T20:13:46Z","timestamp":1739996026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31996-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253372","9783540319962"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31996-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}