{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:22:23Z","timestamp":1742966543924,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711492"},{"type":"electronic","value":"9783319711508"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71150-8_27","type":"book-chapter","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:48:21Z","timestamp":1510793301000},"page":"313-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Better Approximation Ratios for the Single-Vehicle Scheduling Problems on Tree\/Cycle Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4068-7233","authenticated-orcid":false,"given":"Yuanxiao","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4728-6048","authenticated-orcid":false,"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22, 263\u2013282 (1992). https:\/\/doi.org\/10.1002\/net.3230220305","journal-title":"Networks"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/mnsc.36.2.212","volume":"36","author":"HN Psaraftis","year":"1990","unstructured":"Psaraftis, H.N., Solomon, M.M., Magnanti, T.L., Kim, T.-U.: Routing and scheduling on a shoreline with release times. Manage. Sci. 36, 212\u2013223 (1990). https:\/\/doi.org\/10.1287\/mnsc.36.2.212","journal-title":"Manage. Sci."},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/net.10028","volume":"39","author":"Y Karuno","year":"2002","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39(4), 203\u2013209 (2002). https:\/\/doi.org\/10.1002\/net.10028","journal-title":"Networks"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(02)00474-X","volume":"86","author":"DR Gaur","year":"2003","unstructured":"Gaur, D.R., Gupta, A., Krishnamurti, R.: A $$\\frac{5}{3}$$-approximation algorithm for scheduling vehicles on a path with release and handling times. Inform. Process. Lett. 86, 87\u201391 (2003). https:\/\/doi.org\/10.1016\/S0020-0190(02)00474-X","journal-title":"Inform. Process. Lett."},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/978-3-540-92182-0_70","volume-title":"Algorithms and Computation","author":"B Bhattacharya","year":"2008","unstructured":"Bhattacharya, B., Carmi, P., Hu, Y., Shi, Q.: Single vehicle scheduling problems on Path\/Tree\/Cycle Networks with release and handling times. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 800\u2013811. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_70"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/net.20393","volume":"57","author":"W Yu","year":"2011","unstructured":"Yu, W., Liu, Z.: Single vehicle scheduling problems with release and service times on a line. Networks 57, 128\u2013134 (2011). https:\/\/doi.org\/10.1002\/net.20393","journal-title":"Networks"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0166-218X(02)00596-6","volume":"129","author":"Y Karuno","year":"2003","unstructured":"Karuno, Y., Nagamochi, H.: $$2$$-approximation algorithms for the multi-vehicle scheduling prbolem on a path with release and handling times. Discrete Appl. Math. 129, 433\u2013447 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(02)00596-6","journal-title":"Discrete Appl. Math."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.orl.2008.10.006","volume":"37","author":"W Yu","year":"2009","unstructured":"Yu, W., Liu, Z.: Vehicle routing problems on a line-shaped network with release time constraints. Oper. Res. Lett. 37, 85\u201388 (2009). https:\/\/doi.org\/10.1016\/j.orl.2008.10.006","journal-title":"Oper. Res. Lett."},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/3-540-57568-5_280","volume-title":"Algorithms and Computation","author":"Y Karuno","year":"1993","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: Vehicle scheduling on a tree with release and handling times. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 486\u2013495. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57568-5_280"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/03155986.1997.11732334","volume":"35","author":"H Nagamochi","year":"1997","unstructured":"Nagamochi, H., Mochizuki, K., Ibaraki, T.: Complexity of the single vehicle scheduling problem on graphs. Inform. Syst. Oper. Res. 35, 256\u2013276 (1997). https:\/\/doi.org\/10.1080\/03155986.1997.11732334","journal-title":"Inform. Syst. Oper. Res."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.01.046","volume":"434","author":"X Bao","year":"2012","unstructured":"Bao, X., Liu, Z.: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theoret. Comput. Sci. 434, 1\u201310 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.01.046","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2004.05.013","volume":"324","author":"JE Augustine","year":"2004","unstructured":"Augustine, J.E., Seiden, S.S.: Linear time approximation schemes for vehicle scheduling problems. Theoret. Comput. Sci. 324, 147\u2013160 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.05.013","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-17514-5_17","volume-title":"Algorithms and Computation","author":"B Bhattacharya","year":"2010","unstructured":"Bhattacharya, B., Hu, Y.: Approximation algorithms for the multi-vehicle scheduling problem. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 192\u2013205. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17514-5_17"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71150-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:46:55Z","timestamp":1709819215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71150-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711492","9783319711508"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71150-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 November 2017","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":"Shanghai","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}