{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:10:40Z","timestamp":1648987840620},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1007\/s10951-006-8788-y","type":"journal-article","created":{"date-parts":[[2006,7,22]],"date-time":"2006-07-22T00:49:48Z","timestamp":1153529388000},"page":"545-557","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling search procedures: The wheel of fortune"],"prefix":"10.1007","volume":"9","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8788_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R. A. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R. A., J. C. Culberson, and G. J. E. Rawlins, \u201cSearching in the plane,\u201d Information and Computation, 106, 234\u2013252 (1993).","journal-title":"Information and Computation"},{"key":"8788_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., K. Dhamdhere, J. K\u00f6nemann, and A. Sinha, \u201cNon-clairvoyant scheduling for minimizing mean slowdown,\u201d 20th Symposium on Theoretical Aspects of Computer Science, STACS\u20192003, LNCS 2607, pp. 260\u2013270.","DOI":"10.1007\/3-540-36494-3_24"},{"key":"8788_CR3","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E","volume":"38","author":"S. Benkoski","year":"1991","unstructured":"Benkoski, S., M. G. Monticino, and J. R. Weisinger, \u201cA survey of the search theory literature,\u201d Naval Research Logistics, 38, 469\u2013494 (1991).","journal-title":"Naval Research Logistics"},{"key":"8788_CR4","unstructured":"Borodin, A. and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press (1998)."},{"key":"8788_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/mnsc.5.1.44","volume":"5","author":"A. Charnes","year":"1958","unstructured":"Charnes A. and W.W. Cooper, \u201cThe theory of search: Optimal distribution of search effort,\u201d Management Science\n                           5, 44\u201350 (1958).","journal-title":"Management Science"},{"key":"8788_CR6","doi-asserted-by":"crossref","unstructured":"Chrobak, M., L. Epstein, J. Noga, J. Sgall, R. van Stee, T. Tichy, and N. Vakhania, \u201cPreemptive scheduling in overloaded systems,\u201d 29th Int. Colloquium on Automata, Languages and Programming, ICALP\u20192002, LNCS 2380, pp. 800\u2013811.","DOI":"10.1007\/3-540-45465-9_68"},{"key":"8788_CR7","unstructured":"Cooper, D.C., J.R. Frost, and R. Quincy Robe, \u201cCompatibility of Land SAR procedures with search theory,\u201d prepared for U.S. Dept. of Homeland Security, 2003, available on http:\/\/www.uscg.mil\/hq\/G-O\/G-OPR\/nsarc\/nsarc.htm"},{"key":"8788_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/B:JOSH.0000036859.97424.e5","volume":"7","author":"P. Damaschke","year":"2004","unstructured":"Damaschke, P., \u201cScheduling search procedures,\u201d Journal of Scheduling, 7, 349\u2013364 (2004).","journal-title":"Journal of Scheduling"},{"key":"8788_CR9","unstructured":"Frost. J. R., \u201cPrinciples of search theory,\u201d part I\u2013IV, in: Response, 17 (1999)."},{"key":"8788_CR10","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s001820000056","volume":"29","author":"S. Gal","year":"2001","unstructured":"Gal, S., \u201cOn the optimality of a simple strategy for searching graphs,\u201d Int. Journal of Game Theory, 29, 533\u2013542 (2001).","journal-title":"Int. Journal of Game Theory"},{"key":"8788_CR11","unstructured":"Kao, M. Y. and M. L. Littman, \u201cAlgorithms for informed cows,\u201d AAAI-97 Workshop on On-Line Search, 1997."},{"key":"8788_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M. Y. Kao","year":"1996","unstructured":"Kao, M. Y., J. H. Reif, and S. R. Tate, \u201cSearching an unknown environment: an optimal randomized algorithm for the cow-path problem,\u201d Information and Computation, 131, 63\u201379 (1996).","journal-title":"Information and Computation"},{"key":"8788_CR13","unstructured":"Kao, M. Y., Y. Ma, M. Sipser, and Y. Yin, \u201cOptimal constructions of hybrid algorithms,\u201d 5th ACM-SIAM Symposium on Discrete Algorithms, SODA 1994, pp. 372\u2013381."},{"key":"8788_CR14","unstructured":"Koopman, B. O., \u201cSearch and screening,\u201d OEG Report 56, Columbia Univ. Division of War Research, 1946."},{"key":"8788_CR15","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/S0097539796299540","volume":"30","author":"E. Koutsoupias","year":"2000","unstructured":"Koutsoupias, E. and C. Papadimitriou, \u201cBeyond competitive analysis,\u201d SIAM Journal on Computing, 30, 300\u2013317 2000.","journal-title":"SIAM Journal on Computing"},{"key":"8788_CR16","doi-asserted-by":"crossref","unstructured":"Lopez-Ortiz, A. and S. Schuierer, \u201cThe ultimate strategy to search on m rays?,\u201d 4th Conf. on Computing and Combinatorics COCOON 1998, LNCS 1449, pp. 75\u201384.","DOI":"10.1007\/3-540-68535-9_11"},{"key":"8788_CR17","doi-asserted-by":"crossref","unstructured":"Lopez-Ortiz, A. and S. Schuierer, \u201cOnline parallel heuristics and robot searching under the competitive framework,\u201d 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, LNCS 2368, pp. 260\u2013269.","DOI":"10.1007\/3-540-45471-3_27"},{"key":"8788_CR18","doi-asserted-by":"crossref","unstructured":"Mastrolilli, M., \u201cScheduling to minimize max flow time: Offline and online algorithms,\u201d 14th Symposium on Fundamentals of Computation Theory, FCT 2003, LNCS 2751, pp. 49\u201360.","DOI":"10.1007\/978-3-540-45077-1_6"},{"key":"8788_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., S. Phillips, and E. Torng, \u201cNonclairvoyant scheduling,\u201d Theoretical Computer Science, 130, 17\u201347 1994.","journal-title":"Theoretical Computer Science"},{"key":"8788_CR20","unstructured":"Myerson, R. B., Game Theory: Analysis of Conflict. Harvard University Press, 1991."},{"key":"8788_CR21","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0166-218X(97)00011-5","volume":"78","author":"B. V. Stengel","year":"1997","unstructured":"Stengel, B. V. and R. Werchner, \u201cComplexity of searching an immobile hider in a graph,\u201d Discrete Applied Mathematics, 78, 235\u2013249 (1997).","journal-title":"Discrete Applied Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8788-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-006-8788-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8788-y.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8788-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T16:07:27Z","timestamp":1630426047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-006-8788-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["8788"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-8788-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}