{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:33Z","timestamp":1740122373488,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71131006","71532007"],"award-info":[{"award-number":["71131006","71532007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71172197"],"award-info":[{"award-number":["71172197"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10878-017-0215-0","type":"journal-article","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T05:48:52Z","timestamp":1510897732000},"page":"114-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online in-time service problem with minimal server assignment"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2828-838X","authenticated-orcid":false,"given":"Shanxiu","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"issue":"4","key":"215_CR1","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.cie.2007.06.002","volume":"53","author":"C Akjiratikarl","year":"2007","unstructured":"Akjiratikarl C, Yenradee P, Drake PR (2007) PSO-based algorithm for home care worker scheduling in the UK. Comput Ind Eng 53(4):559\u2013583","journal-title":"Comput Ind Eng"},{"key":"215_CR2","first-page":"2","volume-title":"Online computation and competitive analysis (Chapter 1)","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis (Chapter 1). Cambridge University Press, Cambridge, pp 2\u20135"},{"issue":"1","key":"215_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstrm","year":"2008","unstructured":"Bredstrm D, Rnnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191(1):19\u201331","journal-title":"Eur J Oper Res"},{"key":"215_CR4","doi-asserted-by":"crossref","unstructured":"Chen L, Megow N, Schewior K (2016) An \n                    \n                      \n                    \n                    $$O(\\log m)$$\n                    \n                      \n                        \n                          O\n                          (\n                          log\n                          m\n                          )\n                        \n                      \n                    \n                  -competitive algorithm for online machine minimization. In: Twenty-Seventh ACM-SIAM Symposium on Discrete Algorithms. SIAM","DOI":"10.1137\/1.9781611974331.ch12"},{"issue":"3","key":"215_CR5","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1016\/j.ejor.2005.01.011","volume":"171","author":"P Eveborn","year":"2006","unstructured":"Eveborn P, Flisberg P, Rnnqvist M (2006) LAPS CARE\u2014an operational system for staff planning of home care. Eur J Oper Res 171(3):962\u2013976","journal-title":"Eur J Oper Res"},{"issue":"2","key":"215_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1002\/net.21559","volume":"64","author":"P Jaillet","year":"2014","unstructured":"Jaillet P, Lu X (2014) Online traveling salesman problems with service flexibility. Networks 64(2):84\u201395","journal-title":"Networks"},{"key":"215_CR7","doi-asserted-by":"publisher","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"},{"issue":"1","key":"215_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10729-013-9243-1","volume":"17","author":"DS Mankowska","year":"2014","unstructured":"Mankowska DS, Meisel F, Bierwirth C (2014) The home health care routing and scheduling problem with interdependent services. Health Care Manag Sci 17(1):15\u201330","journal-title":"Health Care Manag Sci"},{"issue":"3","key":"215_CR9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10878-013-9654-4","volume":"30","author":"X Wen","year":"2015","unstructured":"Wen X, Xu Y, Zhang H (2015) Online traveling salesman problem with deadlines and service flexibility. J Comb Optim 30(3):545\u2013562","journal-title":"J Comb Optim"},{"issue":"4","key":"215_CR10","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s10878-013-9621-0","volume":"29","author":"Y Xu","year":"2015","unstructured":"Xu Y, Li H, He C et al (2015) The online k-server problem with max-distance objective. J Comb Optim 29(4):836\u2013846","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0215-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0215-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0215-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T00:24:51Z","timestamp":1547857491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0215-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,17]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["215"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0215-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,11,17]]},"assertion":[{"value":"17 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}