{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:19:14Z","timestamp":1767651554632},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s00500-005-0032-8","type":"journal-article","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T13:07:13Z","timestamp":1151672833000},"page":"1-5","source":"Crossref","is-referenced-by-count":9,"title":["An On-line Multi-CBR Agent Dispatching Algorithm"],"prefix":"10.1007","volume":"11","author":[{"given":"Yan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi-Zhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Hu","family":"Ha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,1]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Plaza E, Onta\u00f1\u00f2n S (2001) Ensemble case-based reasoning: collaboration policies for multiagent cooperative CBR. In: Proceedings of ICCBR-01, pp 437\u2013451","DOI":"10.1007\/3-540-44593-5_31"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Onta\u00f1on S, Plaza E (20012001 Learning when to collaborate among learning agents. In: Proceedings of machine learning: EMCL-01, pp 394\u2013405","DOI":"10.1007\/3-540-44795-4_34"},{"key":"32_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou CH, Yannakakis M (1991) Shortest paths without a map. Theor Comput Sci 84:127\u2013150","journal-title":"Theor Comput Sci"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Chrobak M, Larmore L (1992) The server problem and on-line games. In: DIMACS series in discrete mathematics and theoretical computer science, vol 7, pp 11\u201364","DOI":"10.1090\/dimacs\/007\/02"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/S0097539797327180","volume":"31","author":"C Chekuri","year":"2001","unstructured":"Chekuri C, Motwani R, Natarajan B, Stein C (2001) Approximation techniques for average completion time scheduling. SIAM J Comput 31:146\u2013166","journal-title":"SIAM J Comput"},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"MS Manasse","year":"1990","unstructured":"Manasse MS, McGeoch LA, Sleator DD (1990) Competitive algorithms for server problems. J Algorithms 11:208\u2013230","journal-title":"J Algorithms"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-005-0032-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-005-0032-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-005-0032-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:38:08Z","timestamp":1559079488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-005-0032-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["32"],"URL":"https:\/\/doi.org\/10.1007\/s00500-005-0032-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,1]]}}}