{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:40:29Z","timestamp":1726062029805},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36412-0_27","type":"book-chapter","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:04:15Z","timestamp":1575590655000},"page":"340-351","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Car-Sharing Problem: Online Scheduling with Flexible Advance Bookings"],"prefix":"10.1007","author":[{"given":"Haodong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kelin","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huili","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"27_CR1","unstructured":"The future of driving: Seeing the back of the car. The Economist (2012)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/3-540-46541-3_53","volume-title":"STACS 2000","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer, N., Krumke, S.O., Rambau, J.: Online dial-a-ride problems: minimizing the completion time. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 639\u2013650. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-46541-3_53"},{"key":"27_CR3","doi-asserted-by":"publisher","unstructured":"Bjelde, A., et al.: Tight bounds for online TSP on the line. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 994\u20131005. SIAM (2017). \nhttps:\/\/doi.org\/10.1137\/1.9781611974782.63","DOI":"10.1137\/1.9781611974782.63"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-49529-2_17","volume-title":"LATIN 2016: Theoretical Informatics","author":"K B\u00f6hmov\u00e1","year":"2016","unstructured":"B\u00f6hmov\u00e1, K., Disser, Y., Mihal\u00e1k, M., \u0160r\u00e1mek, R.: Scheduling transfers of resources over time: towards car-sharing with flexible drop-offs. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 220\u2013234. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49529-2_17"},{"key":"27_CR5","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11671411_20","volume-title":"Approximation and Online Algorithms","author":"SO Krumke","year":"2006","unstructured":"Krumke, S.O., de Paepe, W.E., Poensgen, D., Lipmann, M., Marchetti-Spaccamela, A., Stougie, L.: On minimizing the maximum flow time in the online dial-a-ride problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 258\u2013269. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11671411_20"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s10878-017-0188-z","volume":"35","author":"A Christman","year":"2018","unstructured":"Christman, A., Forcier, W., Poudel, A.: From theory to practice: maximizing revenues for on-line dial-a-ride. J. Comb. Optim. 35(2), 512\u2013529 (2018)","journal-title":"J. Comb. Optim."},{"key":"27_CR8","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 23\u201325 January 1994, Arlington, Virginia, USA, pp. 302\u2013311 (1994). \nhttp:\/\/dl.acm.org\/citation.cfm?id=314464.314506"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-319-94776-1_21","volume-title":"Computing and Combinatorics","author":"K Luo","year":"2018","unstructured":"Luo, K., Erlebach, T., Xu, Y.: Car-sharing between two locations: online scheduling with flexible advance bookings. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 242\u2013254. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94776-1_21"},{"key":"27_CR10","doi-asserted-by":"publisher","unstructured":"Luo, K., Erlebach, T., Xu, Y.: Car-sharing between two locations: online scheduling with two servers. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, 27\u201331 August 2018, Liverpool, UK. LIPIcs, vol. 117, pp. 50:1\u201350:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.50","DOI":"10.4230\/LIPIcs.MFCS.2018.50"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Luo, K., Erlebach, T., Xu, Y.: Online scheduling of car-sharing requests between two locations with many cars and flexible advance bookings. In: ISAAC 2018: The 29th International Symposium on Algorithms and Computation. LIPIcs, vol. 123. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018, to appear)","DOI":"10.1007\/978-3-319-94776-1_21"},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Luo, K., Erlebach, T., Xu, Y.: Car-sharing on a star network: on-line scheduling with k servers. In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, 13\u201316 March 2019, Berlin, Germany, pp. 51:1\u201351:14 (2019). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.STACS.2019.51","DOI":"10.4230\/LIPIcs.STACS.2019.51"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:12:13Z","timestamp":1575591133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}