{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:52:28Z","timestamp":1773820348740,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642449727","type":"print"},{"value":"9783642449734","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44973-4_35","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T08:47:05Z","timestamp":1385369225000},"page":"315-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop Problem"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Loth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mich\u00e9le","family":"Sebag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youssef","family":"Hamadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,26]]},"reference":[{"issue":"2\u20133","key":"35_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"35_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"JC Beck","year":"2007","unstructured":"Beck, J.C.: Solution-guided multi-point constructive search for job shop scheduling. J. Artif. Intell. Res. 29, 49\u201377 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"35_CR3","unstructured":"Gecode Team: Gecode: Generic constraint development environment, www.gecode.org"},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/2093548.2093574","volume":"55","author":"S Gelly","year":"2012","unstructured":"Gelly, S., et al.: The grand challenge of computer go: monte carlo tree search and extensions. Commun. ACM 55(3), 106\u2013113 (2012)","journal-title":"Commun. ACM"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"ECML 2006. LNCS (LNAI)","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based monte-carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. Inf. Process. Lett. 47, 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"key":"35_CR7","first-page":"275","volume":"26","author":"R Mathon","year":"1985","unstructured":"Mathon, R., Rosa, A.: Tables of parameters for BIBD\u2019s with $$r\\le 41$$ including existence, enumeration, and resolvability results. Ann. Discrete Math. 26, 275\u2013308 (1985)","journal-title":"Ann. Discrete Math."},{"key":"35_CR8","unstructured":"Meseguer P.: Interleaved depth-first search. In: IJCAI 1997, vol. 2, pp. 1382\u20131387 (1997)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Rimmel, A., Teytaud, F., Teytaud, O.: Biasing monte-carlo simulations through RAVE values. In: ICCG 2010, pp. 59\u201368 (2010)","DOI":"10.1007\/978-3-642-17928-0_6"},{"key":"35_CR10","first-page":"160","volume-title":"LION 2012. LNCS","author":"TP Runarsson","year":"2012","unstructured":"Runarsson, T.P., Schoenauer, M., Sebag, M.: Pilot, rollout and monte carlo tree search methods for job shop scheduling. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, vol. 7219, pp. 160\u2013174. Springer, Heidelberg (2012)"},{"key":"35_CR11","first-page":"263","volume-title":"CPAIOR 2008. LNCS","author":"J-P Watson","year":"2008","unstructured":"Watson, J.-P., Beck, J.C.: A hybrid constraint programming\/local search approach to the job-shop scheduling problem. In: Trick, M.A. (ed.) CPAIOR 2008. LNCS, vol. 5015, pp. 263\u2013277. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44973-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T21:00:18Z","timestamp":1675976418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-44973-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449727","9783642449734"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44973-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"26 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}