{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T15:31:44Z","timestamp":1758814304051,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:00:00Z","timestamp":1668816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:00:00Z","timestamp":1668816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871213"],"award-info":[{"award-number":["11871213"]}],"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":[[2023,1]]},"DOI":"10.1007\/s10878-022-00933-3","type":"journal-article","created":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T12:03:02Z","timestamp":1668859382000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Vehicle scheduling problems with two agents on a line"],"prefix":"10.1007","volume":"45","author":[{"given":"Hao","family":"Yan","sequence":"first","affiliation":[]},{"given":"Peihai","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4728-6048","authenticated-orcid":false,"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,19]]},"reference":[{"issue":"2","key":"933_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52(2):229\u2013242","journal-title":"Oper Res"},{"issue":"1","key":"933_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","volume":"150","author":"A Agnetis","year":"2007","unstructured":"Agnetis A, Pacciarelli D, Pacifici A (2007) Multi-agent single machine scheduling. Ann Oper Res 150(1):3\u201315","journal-title":"Ann Oper Res"},{"issue":"4","key":"933_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10951-008-0098-0","volume":"12","author":"A Agnetis","year":"2009","unstructured":"Agnetis A, de Pascale G, Pacciarelli D (2009) A Lagrangian approach to single-machine scheduling problems with two competing agents. J Sched 12(4):401\u2013415","journal-title":"J Sched"},{"issue":"2\u20133","key":"933_CR4","first-page":"147","volume":"324","author":"JE Augustine","year":"2004","unstructured":"Augustine JE, Seiden S (2004) Linear time approximation schemes for vehicle scheduling problems. IFIP Adv Inf Commun Technol 324(2\u20133):147\u2013160","journal-title":"IFIP Adv Inf Commun Technol"},{"issue":"1","key":"933_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6(1):7\u201316","journal-title":"J Sched"},{"key":"933_CR6","first-page":"1","volume":"434","author":"XG Bao","year":"2012","unstructured":"Bao XG, Liu ZH (2012) Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. IFIP Adv Inf Commun Technol 434:1\u201310","journal-title":"IFIP Adv Inf Commun Technol"},{"issue":"2","key":"933_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(02)00474-X","volume":"86","author":"DR Gaur","year":"2003","unstructured":"Gaur DR, Gupta A, Krishnamurti R (2003) A $$\\frac{5}{3}$$-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf Process Lett 86(2):87\u201391","journal-title":"Inf Process Lett"},{"key":"933_CR8","unstructured":"Karuno Y, Nagamochi H, Ibaraki T (1998) A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times. In: Japan-USA Symposium on Flexible Automation, Ohtsu, Japan, pp 1363\u20131366"},{"issue":"16","key":"933_CR9","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1016\/j.ipl.2009.04.018","volume":"109","author":"K Lee","year":"2009","unstructured":"Lee K, Choi BC, Leung JYT, Pinedo ML (2009) Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf Process Lett 109(16):913\u2013917","journal-title":"Inf Process Lett"},{"issue":"2","key":"933_CR10","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JYT Leung","year":"2010","unstructured":"Leung JYT, Pinedo M, Wan GH (2010) Competitive two-agent scheduling and its applications. Oper Res 58(2):458\u2013469","journal-title":"Oper Res"},{"issue":"4","key":"933_CR11","first-page":"256","volume":"35","author":"H Nagamochi","year":"1997","unstructured":"Nagamochi H, Mochizuki K, Ibaraki T (1997) Complexity of the single vehicle scheduling problem on graphs. Inf Syst Oper Res 35(4):256\u2013276","journal-title":"Inf Syst Oper Res"},{"issue":"2","key":"933_CR12","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/mnsc.36.2.212","volume":"36","author":"HN Psaraftis","year":"1990","unstructured":"Psaraftis HN, Solomon MM, Magnanti TL, Kim TU (1990) Routing and scheduling on a shoreline with release times. Manag Sci 36(2):212\u2013223","journal-title":"Manag Sci"},{"issue":"3","key":"933_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis JN (1992) Special cases of traveling salesman and repairman problems with time windows. Networks 22(3):263\u2013282","journal-title":"Networks"},{"issue":"2","key":"933_CR14","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2016.10.024","volume":"258","author":"JQ Wang","year":"2017","unstructured":"Wang JQ, Fan GQ, Zhang Y, Zhang CW, Leung JYT (2017) Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes. Eur J Oper Res 258(2):478\u2013490","journal-title":"Eur J Oper Res"},{"key":"933_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s40305-017-0171-5","volume":"5","author":"LY Yang","year":"2017","unstructured":"Yang LY, Lu XW (2017) Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost. J Oper Res Soc China 5:257\u2013269","journal-title":"J Oper Res Soc China"},{"issue":"2","key":"933_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/net.20393","volume":"57","author":"W Yu","year":"2011","unstructured":"Yu W, Liu Z (2011) Single-vehicle scheduling problems with release and service times on a line. Networks 57(2):128\u2013134","journal-title":"Networks"},{"key":"933_CR17","first-page":"114","volume":"468","author":"KJ Zhao","year":"2013","unstructured":"Zhao KJ, Lu XW (2013) Approximation schemes for two-agent scheduling on parallel machines. IFIP Adv Inf Commun Technol 468:114\u2013121","journal-title":"IFIP Adv Inf Commun Technol"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00933-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00933-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00933-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T07:44:52Z","timestamp":1675496692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00933-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,19]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["933"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00933-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,11,19]]},"assertion":[{"value":"4 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no relevant financial or non-financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"10"}}