{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:44Z","timestamp":1725562604027},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222187"},{"type":"electronic","value":"9783540259459"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25945-9_39","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T11:44:04Z","timestamp":1280922244000},"page":"394-403","source":"Crossref","is-referenced-by-count":3,"title":["Heuristic Rules and Genetic Algorithms for Open Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Puente","sequence":"first","affiliation":[]},{"given":"Helio R.","family":"D\u00edez","sequence":"additional","affiliation":[]},{"given":"Ramiro","family":"Varela","sequence":"additional","affiliation":[]},{"given":"Camino R.","family":"Vela","sequence":"additional","affiliation":[]},{"given":"Luis P.","family":"Hidalgo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C. Bierwirth","year":"1995","unstructured":"Bierwirth, C.: A Generalized Permutation Approach to Jobshop Scheduling with Genetic Algorithms. OR Spectrum\u00a017, 87\u201392 (1995)","journal-title":"OR Spectrum"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","volume":"76","author":"P. Brucker","year":"1997","unstructured":"Brucker, P., Hurink, J., Jurish, B., Wostmann, B.: A branch and bound algorithm for the open-shop problem. Discrete Applied Mathematics\u00a076, 43\u201359 (1997)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"39_CR3","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzales","year":"1976","unstructured":"Gonzales, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of the Association of Computing Machinery\u00a023(4), 665\u2013679 (1976)","journal-title":"Journal of the Association of Computing Machinery"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B. Giffler","year":"1960","unstructured":"Giffler, B., Thomson, G.L.: Algorithms for Solving Production Scheduling Problems. Operations Reseach\u00a08, 487\u2013503 (1960)","journal-title":"Operations Reseach"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/S0377-2217(97)00332-9","volume":"107","author":"C.. Gu\u00e9ret","year":"1998","unstructured":"Gu\u00e9ret, C., Prins, C.: Classical and new heuristics for the open-shop problem: A computational study. European Journal of Operational Research\u00a0107, 306\u2013314 (1998)","journal-title":"European Journal of Operational Research"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0377-2217(97)00366-4","volume":"111","author":"C.-F. Liaw","year":"1998","unstructured":"Liaw, C.-F.: An iterative improvement approach for the nonpreemtive open shop scheuling problem. European Journal of Operational Research\u00a0111, 509\u2013517 (1998)","journal-title":"European Journal of Operational Research"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0377-2217(99)00168-X","volume":"124","author":"C.-F. Liaw","year":"2000","unstructured":"Liaw, C.-F.: A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operational Research\u00a0124, 28\u201352 (2000)","journal-title":"European Journal of Operational Research"},{"key":"39_CR8","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Enblewoodd Cliffs (1995)"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Bechmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(02)00205-9","volume":"145","author":"R. Varela","year":"2003","unstructured":"Varela, R., Vela, C.R., Puente, J., G\u00f3mez, A.: A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. European Journal of Operational Research\u00a0145, 57\u201371 (2003)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25945-9_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:17:32Z","timestamp":1620011852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25945-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222187","9783540259459"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25945-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}