{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:18:59Z","timestamp":1725495539465},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540758662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75867-9_105","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T03:34:40Z","timestamp":1195184080000},"page":"837-844","source":"Crossref","is-referenced-by-count":0,"title":["Bandit-Based Monte-Carlo Planning for the Single-Machine Total Weighted Tardiness Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Kronberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Braune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"105_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. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"105_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1080\/07408170304390","volume":"35","author":"S. Avci","year":"2003","unstructured":"Avci, S., Selim Akturk, M., Storer, R.H.: A problem space algorithm for single machine weighted tardiness problems. IIE Transactions\u00a035, 479\u2013486 (2003)","journal-title":"IIE Transactions"},{"issue":"11","key":"105_CR3","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1038\/sj\/jors\/0411109","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society\u00a041(11), 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"},{"key":"105_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/3-540-45356-3_60","volume-title":"Parallel Problem Solving from Nature-PPSN VI","author":"M. Besten den","year":"2000","unstructured":"den Besten, M., St\u00fctzle, T., Dorigo, M.: Ant Colony Optimization for the Total Weighted Tardiness Problem. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) Parallel Problem Solving from Nature-PPSN VI. LNCS, vol.\u00a01917, pp. 611\u2013620. Springer, Heidelberg (2000)"},{"issue":"3","key":"105_CR5","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1016\/j.ejor.2005.10.030","volume":"176","author":"\u00dc. Bilge","year":"2007","unstructured":"Bilge, \u00dc., Kurtulan, M., Kirac, F.: A tabu search algorithm for the single machine total weighted tardiness problem. European Journal for Operational Research\u00a0176(3), 1423\u20131435 (2007)","journal-title":"European Journal for Operational Research"},{"issue":"1","key":"105_CR6","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R.K. Congram","year":"2002","unstructured":"Congram, R.K., Potts, C.N., van de Velde, S.N.: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem. INFORMS Journal on Computing\u00a014(1), 52\u201367 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"105_CR7","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modifications of UCT with Patterns in Monte-Carlo Go. Technical Report, No. 6062. INRIA (2006)"},{"key":"105_CR8","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":"105_CR9","unstructured":"Morton, T.E., Rachamadugu, R.M., Vepsalainen, A.: Accurate myoptic heuristics for tardiness scheduling. GSIA Working Paper No. 36\u201383\u201384. Carnegie-Mellon University Pittsburgh, PA (1984)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2013 EUROCAST 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75867-9_105.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:35:20Z","timestamp":1619519720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75867-9_105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540758662"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75867-9_105","relation":{},"subject":[]}}