{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:25:08Z","timestamp":1648801508595},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10951-020-00644-9","type":"journal-article","created":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T11:03:12Z","timestamp":1581764592000},"page":"451-464","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interruptible algorithms for multiproblem solving"],"prefix":"10.1007","volume":"23","author":[{"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,15]]},"reference":[{"key":"644_CR1","volume-title":"The theory of search games and rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern, S., & Gal, S. (2003). The theory of search games and rendezvous. New York: Kluwer Academic Publishers."},{"key":"644_CR2","unstructured":"Angelopoulos, S. (2015). Further connections between contract-scheduling and ray-searching problems. In Proceedings of the 24th International Joint Conference in Artificial Intelligence (IJCAI), (pp. 1516\u20131522)."},{"key":"644_CR3","unstructured":"Angelopoulos, S., & L\u00f3pez-Ortiz, A. (2009). Interruptible algorithms for multi-problem solving. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), (pp. 380\u2013386)."},{"issue":"3","key":"644_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10951-016-0483-z","volume":"20","author":"S Angelopoulos","year":"2017","unstructured":"Angelopoulos, S., L\u00f3pez-Ortiz, A., & Hamel, A. (2017). Optimal scheduling of contract algorithms with soft deadlines. Journal of Scheduling, 20(3), 267\u2013277.","journal-title":"Journal of Scheduling"},{"key":"644_CR5","unstructured":"Bernstein, D.S., Finkelstein, L., & Zilberstein, S. (2003). Contract algorithms and robots on rays: Unifying two scheduling problems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), (pp. 1211\u20131217)."},{"key":"644_CR6","unstructured":"Bernstein, D.S., Perkins, T.J., Zilberstein, S., & Finkelstein, L. (2002). Scheduling contract algorithms on multiple processors. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), (pp. 702\u2013706)."},{"issue":"4","key":"644_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/1189056.1189078","volume":"37","author":"M Chrobak","year":"2006","unstructured":"Chrobak, M., & Mathieu, C. (2006). Competitiveness via doubling. SIGACT News, 37(4), 115\u2013126.","journal-title":"SIGACT News"},{"key":"644_CR8","unstructured":"Dean, T., & Boddy, M.S., (1998). An analysis of time-dependent planning. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), (pp. 49\u201354)."},{"issue":"3","key":"644_CR9","first-page":"67","volume":"36","author":"R Dorrigiv","year":"2005","unstructured":"Dorrigiv, R., & L\u00f3pez-Ortiz, A. (2005). A survey of performance measures for on-line algorithms. SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 36(3), 67\u201381.","journal-title":"SIGACT News (ACM Special Interest Group on Automata and Computability Theory)"},{"key":"644_CR10","volume-title":"Search games","author":"S Gal","year":"1980","unstructured":"Gal, S. (1980). Search games. Cambridge: Academic Press."},{"issue":"1\u20132","key":"644_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C. P., & Selman, B. (2001). Algorithm portfolios. Artificial Intelligence, 126(1\u20132), 43\u201362.","journal-title":"Artificial Intelligence"},{"key":"644_CR12","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R Graham","year":"1966","unstructured":"Graham, R. (1966). Bounds for certain microprocessing anomalies. Bell System Technical Journal, 45, 1563\u201381.","journal-title":"Bell System Technical Journal"},{"key":"644_CR13","unstructured":"Horvitz, E. (1987). Reasoning about beliefs and actions under computational resource constraints. In Proceedings of the 3rd Conference on Uncertainty in Artificial Intelligence (UAI), (pp. 301\u2013324)."},{"key":"644_CR14","unstructured":"Horvitz, E. (1999). Reasoning under varying and uncertain resource constraints. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), (pp. 111\u2013116)."},{"key":"644_CR15","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G. (2009). Hyperbolic dovetailing. In Proceedings of the 17th Annual European Symposium on Algorithms (ESA), (pp. 616\u2013627).","DOI":"10.1007\/978-3-642-04128-0_46"},{"key":"644_CR16","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1613\/jair.4360","volume":"51","author":"A L\u00f3pez-Ortiz","year":"2014","unstructured":"L\u00f3pez-Ortiz, A., Angelopoulos, S., & Hamel, A. M. (2014). Optimal scheduling of contract algorithms for anytime problems. Journal of Artificial Intelligence Research, 51, 533\u2013554.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"644_CR17","doi-asserted-by":"crossref","unstructured":"McGregor, A., Onak, K., & Panigrahy, R. (2009). The oil searching problem. In Proceeding of the 17th European Symposium on Algorithms (ESA), (pp. 504\u2013515).","DOI":"10.1007\/978-3-642-04128-0_45"},{"key":"644_CR18","unstructured":"Russell, S.J., & Zilberstein, S. (1991). Composing real-time systems.In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI), (pp. 212\u2013217)."},{"issue":"1","key":"644_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0925-7721(00)00030-4","volume":"18","author":"S Schuierer","year":"2001","unstructured":"Schuierer, S. (2001). Lower bounds in online geometric searching. Computational Geometry: Theory and Applications, 18(1), 37\u201353.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"644_CR20","unstructured":"Streeter, M.J., & Smith, S.F. (2008). New techniques for algorithm portfolio design. In Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence (UAI), (pp. 519\u2013527)."},{"issue":"3","key":"644_CR21","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. AI Magazine, 17(3), 73\u201383.","journal-title":"AI Magazine"},{"issue":"1\u20132","key":"644_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1024412831598","volume":"39","author":"S Zilberstein","year":"2003","unstructured":"Zilberstein, S., Charpillet, F., & Chassaing, P. (2003). Optimal sequencing of contract algorithms. Annals of Mathematics and Artificial Intelligence, 39(1\u20132), 1\u201318.","journal-title":"Annals of Mathematics and Artificial Intelligence"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00644-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-020-00644-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00644-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T10:14:28Z","timestamp":1613297668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-020-00644-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,15]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["644"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00644-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,15]]},"assertion":[{"value":"15 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}