{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:41Z","timestamp":1759638041753},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0020-0190(02)00474-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"87-91","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["A  -approximation algorithm for scheduling vehicles on a path with release and handling times"],"prefix":"10.1016","volume":"86","author":[{"given":"Daya Ram","family":"Gaur","sequence":"first","affiliation":[]},{"given":"Arvind","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00474-X_BIB001","first-page":"1363","article-title":"A 1.5-approximation for single vehicle scheduling problem on a line with release and handling times","volume":"3","author":"Karuno","year":"1998"},{"key":"10.1016\/S0020-0190(02)00474-X_BIB002","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1018928911513","article-title":"Vehicle scheduling on a tree with release and handling time","volume":"69","author":"Karuno","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0020-0190(02)00474-X_BIB003","series-title":"Proc. 9th Annual European Symposium on Algorithms (ESA)","first-page":"218","article-title":"A 2-approximation algorithm for multi-vehicle scheduling problem on a path with release and handling times","author":"Karuno","year":"2001"},{"key":"10.1016\/S0020-0190(02)00474-X_BIB004","series-title":"Proc. International Symposium on Algorithms and Computation (ISAAC)","first-page":"36","article-title":"A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times","author":"Karuno","year":"2001"},{"key":"10.1016\/S0020-0190(02)00474-X_BIB005","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/mnsc.36.2.212","article-title":"Routing and scheduling on a shoreline with release times","volume":"36","author":"Psaraftis","year":"1990","journal-title":"Management Sci."},{"key":"10.1016\/S0020-0190(02)00474-X_BIB006","series-title":"Flexible Manufacturing Systems in Practice","author":"Talavage","year":"1988"},{"key":"10.1016\/S0020-0190(02)00474-X_BIB007","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/net.3230220305","article-title":"Special cases of traveling salesman and repairman problems with time windows","volume":"22","author":"Tsitsiklis","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(02)00474-X_BIB008","series-title":"Production Planning and Scheduling in Flexible Assembly Systems","author":"Savik","year":"1999"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900200474X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900200474X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T08:27:57Z","timestamp":1718440077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900200474X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S002001900200474X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00474-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A -approximation algorithm for scheduling vehicles on a path with release and handling times","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(02)00474-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}