{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T02:33:44Z","timestamp":1761964424004,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_12","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:58:57Z","timestamp":1349071137000},"page":"160-174","source":"Crossref","is-referenced-by-count":6,"title":["Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Thomas Philip","family":"Runarsson","sequence":"first","affiliation":[]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[]},{"given":"Mich\u00e8le","family":"Sebag","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for sat. Journal of Artificial Intelligence Research\u00a032, 565\u2013606 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"12_CR2","unstructured":"Burke, E., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: Hyper-heuristics: A Survey of the State of the Art. Technical report, NOTTCS-TR-SUB-0906241418-2747, University of Nottingham (2010), http:\/\/www.cs.nott.ac.uk\/~gxo\/papers\/hhsurvey.pdf"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C. Duin","year":"1999","unstructured":"Duin, C., Vo\u00df, S.: The Pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks\u00a034(3), 181\u2013191 (1999)","journal-title":"Networks"},{"key":"12_CR4","unstructured":"Lagoudakis, M.G., Parr, R.: Reinforcement learning as classification: Leveraging modern classifiers. In: Fawcett, T., Mishra, N. (eds.) Proc. 20th Int. Conf. on Machine Learning (ICML 2003), pp. 424\u2013431. AAAI Press (2003)"},{"key":"12_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","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.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in uct. In: Proc. of the 24th Int. Conf. on Machine learning (ICML 2007), pp. 273\u2013280. ACM Press (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"12_CR7","unstructured":"Asmuth, J., Littman, M.: Learning is planning: near Bayes-optimal reinforcement learning via Monte-Carlo tree search. In: Proceedings of The 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011 (2011)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T. Lai","year":"1985","unstructured":"Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics\u00a06, 4\u201322 (1985)","journal-title":"Advances in Applied Mathematics"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"De Mesmay, F., Rimmel, A., Voronenko, Y., P\u00fcschel, M.: Bandit-Based Optimization on Graphs with Application to Library Performance Tuning. In: Danyluk, A., Bottou, L., Littman, M. (eds.) Proc. Int. Conf. on Machine Learning (ICML 2009). ACM International Conference Proceeding Series, vol.\u00a0382, pp. 729\u2013736. ACM (2009)","DOI":"10.1145\/1553374.1553468"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-04174-7_20","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"P. Rolet","year":"2009","unstructured":"Rolet, P., Sebag, M., Teytaud, O.: Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part II. LNCS, vol.\u00a05782, pp. 302\u2013317. Springer, Heidelberg (2009)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Matsumoto, S., Hirosue, N., Itonaga, K., Ueno, N., Ishii, H.: Monte-Carlo Tree Search for a reentrant scheduling problem. In: 40th Intl. Conf. on Computers and Industrial Engineering (CIE 2010), pp. 1\u20136. IEEE (2010)","DOI":"10.1109\/ICCIE.2010.5668320"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/11889205_40","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"M.J. Streeter","year":"2006","unstructured":"Streeter, M.J., Smith, S.F.: A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 560\u2013574. Springer, Heidelberg (2006)"},{"key":"12_CR13","unstructured":"Brucker, P.: Scheduling algorithms. Springer (2007)"},{"key":"12_CR14","unstructured":"Br\u00e4sel, H., Dornheim, L., Kutz, S., M\u00f6rig, M., R\u00f6ssling, I.: LiSA \u2013 Library of Scheduling Algorithms. Otto-von-Guericke Universit\u00e4t Magdeburg (2011), http:\/\/lisa.math.uni-magdeburg.de"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S. Panwalkar","year":"1977","unstructured":"Panwalkar, S., Iskander, W.: A Survey of Scheduling Rules. Operations Research\u00a025(1), 45\u201361 (1977)","journal-title":"Operations Research"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Kawai, T., Fujimoto, Y.: An efficient combination of dispatch rules for job-shop scheduling problem. In: 3rd IEEE Intl Conf. on Industrial Informatics (INDIN 2005), pp. 484\u2013488 (2005)","DOI":"10.1109\/INDIN.2005.1560424"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S. Vo\u00df","year":"2005","unstructured":"Vo\u00df, S., Fink, A., Duin, C.: Looking ahead with the pilot method. Annals of Operations Research\u00a0136(1), 285\u2013302 (2005)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1009635226865","volume":"3","author":"D. Bertsekas","year":"1997","unstructured":"Bertsekas, D., Tsitsiklis, J., Wu, C.: Rollout algorithms for combinatorial optimization. Journal of Heuristics\u00a03(3), 245\u2013262 (1997)","journal-title":"Journal of Heuristics"},{"issue":"2-3","key":"12_CR19","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. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"12_CR20","unstructured":"Cicirello, V., Smith, S.: The max k-armed bandit: A new model of exploration applied to search heuristic selection. In: Veloso, M.M., Kambhampati, S. (eds.) Proc. Nat. Conf. on Artificial Intelligence, pp. 1355\u20131361. AAAI Press \/ The MIT Press (2005)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-11169-3_13","volume-title":"Learning and Intelligent Optimization","author":"\u00c1. Fialho","year":"2009","unstructured":"Fialho, \u00c1., Da Costa, L., Schoenauer, M., Sebag, M.: Dynamic Multi-Armed Bandits and Extreme Value-Based Rewards for Adaptive Operator Selection in Evolutionary Algorithms. In: St\u00fctzle, T. (ed.) LION 3. LNCS, vol.\u00a05851, pp. 176\u2013190. Springer, Heidelberg (2009)"},{"issue":"2","key":"12_CR22","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(2), 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"12_CR23","unstructured":"Yamada, T., Nakano, R.: A genetic algorithm applicable to large-scale job shop Problems. In: M\u00e4nner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature (PPSN II), pp. 283\u2013292. Elsevier (1992)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Banharnsakun, A., Sirinaovakul, B., Achalakul, T.: Job Shop Scheduling with the Best-so-far ABC. In: Engineering Applications of Artificial Intelligence (2006), pp. 1\u201311 (2011)","DOI":"10.1016\/j.asoc.2010.11.025"}],"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-34413-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T20:52:00Z","timestamp":1744231920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}