{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:14:39Z","timestamp":1725495279250},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673538"},{"type":"electronic","value":"9783540455615"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45561-2_27","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:49:28Z","timestamp":1195217368000},"page":"280-289","source":"Crossref","is-referenced-by-count":3,"title":["A Systematic Investigation of GA Performance on Jobshop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Emma","family":"Hart","sequence":"first","affiliation":[]},{"given":"Peter","family":"Ross","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"key":"27_CR1","unstructured":"http:\/\/www.dai.ed.ac.uk\/~emmah\/jobshop-expts.html."},{"key":"27_CR2","first-page":"10","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"S. Bagchi","year":"1991","unstructured":"Sugato Bagchi, Serdar Uckun, Yutaka Miyabe, and Kazuhiko Kawamura. Exploring problem-specific recombination operators for job shop scheduling. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 10\u201317. San Mateo: Morgan Kaufmann, 1991."},{"key":"27_CR3","unstructured":"Brizuela. C.A. and N. Sannomiya. A diversity study in genetic algorithms for jobshop. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 75\u201383, 1999."},{"key":"27_CR4","first-page":"136","volume-title":"Proceedings of the International Conference on Genetic Algorithms and their Applications","author":"L. Davis","year":"1985","unstructured":"L. Davis. Job shop scheduling with genetic algorithms. In J. J. Grefenstette, editor, Proceedings of the International Conference on Genetic Algorithms and their Applications, pages 136\u2013140. San Mateo: Morgan Kaufmann, 1985."},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B. Giffler","year":"1960","unstructured":"B. Giffler and G.L. Thompson. Algorithm for solving production scheduling problems. Operations Research, 8(4):487\u2013503, 1960.","journal-title":"Operations Research"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"E. Hart and P. Ross. A heuristic combination method for jobshop scheduling problems. In Parallel Problem Solving from Nature, PPSN-V, pages 845\u2013854, 1998.","DOI":"10.1007\/BFb0056926"},{"issue":"1\u20132","key":"27_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00044-5","volume":"81","author":"T. Hogg","year":"1996","unstructured":"T. Hogg, A. Huberman, and C.P. Williams. Phase transitions and the search problem. Artificial Intelligence, 81(1\u20132):1\u201315, 1996.","journal-title":"Artificial Intelligence"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"S-C. Lin, E.D. Goodman, and W.F. Punch. A genetic algorithm approach to dynamic job-shop scheduling problems. In Thomas Back, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 481\u2013489. Morgan-Kaufmann, 1997.","DOI":"10.1007\/BFb0014827"},{"key":"27_CR9","first-page":"474","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"R. Nakano","year":"1991","unstructured":"R. Nakano and T. Yamada. Conventional genetic algorithms for job shop problems. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 474\u2013479. San Mateo: Morgan Kaufmann, 1991."},{"issue":"1\u20132","key":"27_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(95)00048-8","volume":"81","author":"P. Prosser","year":"1996","unstructured":"P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81(1\u20132):81\u2013109, 1996.","journal-title":"Artificial Intelligence"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"P Ross, E Hart, and D Corne. Some observations about ga-based exam timetabling. In Practice and Theory of Automated Timetabling, pages 115\u2013130, 1997.","DOI":"10.1007\/BFb0055884"},{"issue":"1\u20132","key":"27_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B.M. Smith","year":"1996","unstructured":"B.M. Smith and M.E. Dyer. Locating the phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81(1\u20132):155\u2013181, 1996.","journal-title":"Artificial Intelligence"},{"key":"27_CR13","unstructured":"P. Van Bael, D. Devogelaere, and M. Rijckaert. The job shop problem solved with simple, basis evolutionary search elements. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 665\u2013670, 1999."}],"container-title":["Lecture Notes in Computer Science","Real-World Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45561-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:33:35Z","timestamp":1556969615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45561-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673538","9783540455615"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45561-2_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}