{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:09:58Z","timestamp":1742983798425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_18","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"214-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Routing and Scheduling Problems with Two Agents on a Line-Shaped Network"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4608-3254","authenticated-orcid":false,"given":"Hao","family":"Yan","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":[[2021,12,11]]},"reference":[{"issue":"3","key":"18_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(3), 263\u2013282 (1992)","journal-title":"Networks"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/mnsc.36.2.212","volume":"36","author":"H Psaraftis","year":"1990","unstructured":"Psaraftis, H., Solomon, M.M., Magnanti, T.L., Kim, T.U.: Routing and scheduling on a shoreline with release times. Manag. Sci. 36, 212\u2013223 (1990)","journal-title":"Manag. Sci."},{"key":"18_CR3","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: A 1.5-approximation for single vehicle scheduling problem on a line with release and handling times. In: Proceedings ISCIE\/ASME 1998 Japan-USA Symp on Flexible Automation, Ohtsu, Japan, pp. 1363\u20131368 (1998)"},{"issue":"2","key":"18_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. Inf. Process. Lett. 86(2), 87\u201391 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/net.20393","volume":"57","author":"W Yu","year":"2010","unstructured":"Yu, W., Liu, Z.: Single-vehicle scheduling problems with release and service times on a line. Networks 57(2), 128\u2013134 (2010)","journal-title":"Networks"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker, K.R., Smith, J.C.: A multiple-criterion model for machine scheduling. J. Sched. 6(1), 7\u201316 (2003)","journal-title":"J. Sched."},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problem with two competing agents. Oper. Res. 52(2), 229\u2013242 (2004)","journal-title":"Oper. Res."},{"issue":"1","key":"18_CR8","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.: Multi-agent single machine scheduling. Ann. Oper. Res. 150(1), 3\u201315 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"TCE Cheng","year":"2008","unstructured":"Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188(2), 603\u2013609 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"16","key":"18_CR10","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, B.C., Leung, J.Y.T., Pinedo, M.L.: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf. Process. Lett. 109(16), 913\u2013917 (2009)","journal-title":"Inf. Process. Lett."}],"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-030-92681-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:05:35Z","timestamp":1639353935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","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":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"62","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":"16","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":"8","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":"26% - 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":"4.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":"2.75","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}