{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:39:55Z","timestamp":1649057995261},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T00:00:00Z","timestamp":1466035200000},"content-version":"unspecified","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":[[2017,6]]},"DOI":"10.1007\/s10951-016-0483-z","type":"journal-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T10:40:28Z","timestamp":1466073628000},"page":"267-277","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal scheduling of contract algorithms with soft deadlines"],"prefix":"10.1007","volume":"20","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"}]},{"given":"Ang\u00e8le","family":"Hamel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,16]]},"reference":[{"key":"483_CR1","unstructured":"Angelopoulos, S. (2015). Further connections between contract-scheduling and ray-searching problems. In Proceedings of the 24th International Joint Conference in Artificial Intelligence (JCAI) (pp. 1516\u20131522)."},{"key":"483_CR2","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)."},{"key":"483_CR3","unstructured":"Angelopoulos, S., L\u00f3pez-Ortiz, A., & Hamel, A. (2008). Optimal scheduling of contract algorithms with soft deadlines. In Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI) (pp. 868\u2013873)."},{"key":"483_CR4","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":"483_CR5","unstructured":"Bernstein, D.S., Perkins, T.J., Zilberstein, S., & Finkelstein, L. (2002). Scheduling contract algorithms on multiple processors. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI) (pp. 702\u2013706)."},{"key":"483_CR6","unstructured":"Dean, T., & Boddy, M.S. (1998). An analysis of time-dependent planning. In Proceedings of the 15th National Conference on Artificial Intelligence (pp. 49\u201354)."},{"key":"483_CR7","volume-title":"Search games","author":"S Gal","year":"1980","unstructured":"Gal, S. (1980). Search games. New York: Academic Press."},{"key":"483_CR8","unstructured":"Horvitz, E. (1987). Reasoning about beliefs and actions under computational resource constraints. In Proceedings of the 3rd Annual Conference on Uncertainty in Artificial Intelligence (pp. 301\u2013324)."},{"key":"483_CR9","unstructured":"Horvitz, E. (1998). Reasoning under varying and uncertain resource constraints. In Proceedings of the 15th National Conference on Artificial Intelligence (pp. 111\u2013116)."},{"key":"483_CR10","doi-asserted-by":"crossref","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":"483_CR11","doi-asserted-by":"publisher","unstructured":"Manolache, S.n, Eles, P., & Peng, Z. (2004). Optimization of soft real-time systems with deadline miss ratio constraints. In Proceedings of 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS\u201904) (p. 562).","DOI":"10.1109\/RTTAS.2004.1317304"},{"key":"483_CR12","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":"483_CR13","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"},{"issue":"3","key":"483_CR14","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":"483_CR15","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). Real-time problem-solving with contract algorithms. Annals of Mathematics and Artificial Intelligence, 39(1\u20132), 1\u201318.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1\u20132","key":"483_CR16","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-016-0483-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0483-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0483-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0483-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T20:31:32Z","timestamp":1568061092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0483-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,16]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["483"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0483-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,16]]}}}