{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T14:19:42Z","timestamp":1780323582874,"version":"3.54.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T00:00:00Z","timestamp":1351209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11590-012-0578-1","type":"journal-article","created":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T12:16:35Z","timestamp":1351167395000},"page":"1627-1642","source":"Crossref","is-referenced-by-count":5,"title":["A constant-factor approximation algorithm for multi-vehicle collection for processing problem"],"prefix":"10.1007","volume":"7","author":[{"given":"E.","family":"Y\u00fccel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F. S.","family":"Salman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E. L.","family":"\u00d6rmeci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E. S.","family":"Gel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,10,26]]},"reference":[{"key":"578_CR1","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","volume":"40","author":"JH Ahmadi","year":"1992","unstructured":"Ahmadi, J.H., Ahmadi, R.H., Dasu, S., Tang, C.S.: Batching and scheduling jobs on batch and discrete processors. Oper. Res. 40, 750\u2013763 (1992)","journal-title":"Oper. Res."},{"key":"578_CR2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1080\/07408179808966485","volume":"30","author":"TCE Cheng","year":"1998","unstructured":"Cheng, T.C.E., Wang, G.: Batching and scheduling to minimize the makespan in the two-machine flowshop. IIE Trans. 30, 447\u2013453 (1998)","journal-title":"IIE Trans."},{"key":"578_CR3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.29.3.267","volume":"29","author":"PM Franca","year":"1995","unstructured":"Franca, P.M., Gendreau, M., Laporte, G., M\u00fcller, F.M.: The $$m$$ -traveling salesman problem with minmax objective. Transp. Sci. 29, 267\u2013275 (1995)","journal-title":"Transp. Sci."},{"key":"578_CR4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7, 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"578_CR5","doi-asserted-by":"crossref","unstructured":"McDonald, J.J.: Vehicle scheduling\u2014a case study. Oper. Res. Q. (1970\u20131977) 23, 433\u2013444 (1972)","DOI":"10.2307\/3007958"},{"key":"578_CR6","unstructured":"Revere, L.: Re-engineering proves effective for reducing courier costs. Bus. Process Manag. J. 10, 400\u2013414 (2004)"},{"key":"578_CR7","volume-title":"The Design of Approximation Algorithms, Page Numbers","author":"DP Williamson","year":"2010","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, Page Numbers. Cambridge University Press, New York (2010)"},{"key":"578_CR8","doi-asserted-by":"crossref","unstructured":"Y\u00fccel, E., Salman F.S., Gel E.S., \u00d6rmeci, E.L., Gel, A.: Optimizing specimen collection for processing in clinical testing laboratories. Eur. J. Oper. Res. (2012, accepted)","DOI":"10.1016\/j.ejor.2012.10.044"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0578-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0578-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0578-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T00:13:02Z","timestamp":1562285582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0578-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,26]]},"references-count":8,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["578"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0578-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,26]]}}}