{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:57:11Z","timestamp":1725541031865},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642111686"},{"type":"electronic","value":"9783642111693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11169-3_10","type":"book-chapter","created":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T21:26:05Z","timestamp":1259357165000},"page":"134-147","source":"Crossref","is-referenced-by-count":3,"title":["Selection of Heuristics for the Job-Shop Scheduling Problem Based on the Prediction of Gaps in Machines"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Abreu","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Soares","sequence":"additional","affiliation":[]},{"given":"Jorge M. S.","family":"Valente","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Abreu, P., Soares, C.: Mapping charateristics of instances to evolutionary algorithm operators: an empirical study on the basic job-shop scheduling problem. In: Salido, M.A., Fdez-Olivares, J. (eds.) Proceedings of the CAEPIA 2007 Workshop on Planning, Scheduling and Constraint Satisfaction, November 2007, pp. 80\u201392 (2007)"},{"key":"10_CR2","volume-title":"Introduction to Sequencing and Scheduling","author":"K.R. Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)"},{"key":"10_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"issue":"4","key":"10_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., Thompson, G.L.: Algorithms for solving production scheduling problems. Operations Research\u00a08(4), 487\u2013503 (1960)","journal-title":"Operations Research"},{"key":"10_CR5","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. European Journal of Operational Research\u00a0113, 390\u2013434 (1999)","journal-title":"European Journal of Operational Research"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Kononenko, I., Kukar, M.: Introduction to Machine Learning and Data Mining: Introduction to Principles and Algorithms. Horwood Publishing (2007)","DOI":"10.1533\/9780857099440"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"J.K. Lenstra","year":"1979","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Computational complexity of discrete pptimisation problems. Annals of Discrete Mathematics\u00a04, 121\u2013140 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"10_CR8","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.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"10_CR9","unstructured":"Watson, J.-P., Barbulescu, L., Howe, A.E., Whitley, D.: Algorithm performance and problem structure for flow-shop scheduling. In: AAAI\/IAAI, pp. 688\u2013695 (1999)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11169-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:46:16Z","timestamp":1619783176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11169-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642111686","9783642111693"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11169-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}