{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T17:04:21Z","timestamp":1766336661951,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T00:00:00Z","timestamp":1667347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T00:00:00Z","timestamp":1667347200000},"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 Nature Science Foundation of China","doi-asserted-by":"crossref","award":["61972092"],"award-info":[{"award-number":["61972092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Collaborative Innovation Major Project of Zhengzhou","award":["20XTZX06013"],"award-info":[{"award-number":["20XTZX06013"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10951-022-00762-6","type":"journal-article","created":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:28:23Z","timestamp":1667417303000},"page":"559-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An improved approximation algorithm for a scheduling problem with transporter coordination"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9193-1756","authenticated-orcid":false,"given":"Yinling","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacek","family":"Blazewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,2]]},"reference":[{"issue":"1","key":"762_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01325094","volume":"4","author":"J Blazewicz","year":"1991","unstructured":"Blazewicz, J., Eiselt, H. A., Finke, G., Laporte, G., & Weglarz, J. (1991). Scheduling tasks and vehicles in a flexible manufacturing system. International Journal of Flexible Manufacturing Systems, 4(1), 5\u201316.","journal-title":"International Journal of Flexible Manufacturing Systems"},{"issue":"2","key":"762_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0895-7177(94)90203-8","volume":"20","author":"J Blazewicz","year":"1994","unstructured":"Blazewicz, J., Burkard, R. E., Finke, G., & W\u00f6ginger, G. J. (1994). Vehicle scheduling in two-cycle flexible manufacturing systems. Mathematical and Computer Modelling, 20(2), 19\u201331.","journal-title":"Mathematical and Computer Modelling"},{"doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., & Weglarz, J. (2019). Handbook on scheduling. Springer.","key":"762_CR3","DOI":"10.1007\/978-3-319-99849-7"},{"issue":"2","key":"762_CR4","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/S0377-2217(03)00364-3","volume":"158","author":"Y Chang","year":"2004","unstructured":"Chang, Y., & Lee, C. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, 158(2), 470\u2013487.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"762_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5(1), 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1\u20133","key":"762_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00316-4","volume":"112","author":"J Hurink","year":"2001","unstructured":"Hurink, J., & Knust, S. (2001). Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics, 112(1\u20133), 199\u2013216.","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Johnson, D. S. (2008). Bin Packing (pp. 1\u201399). Springer.","key":"762_CR7","DOI":"10.1007\/978-0-387-30162-4_49"},{"issue":"4","key":"762_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D. S., Demers, A. J., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974). Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3(4), 299\u2013325.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"762_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two-and three-stage production schedules with setup times included. Naval research logistics quarterly, 1(1), 61\u201368.","journal-title":"Naval research logistics quarterly"},{"issue":"3","key":"762_CR10","doi-asserted-by":"publisher","first-page":"354","DOI":"10.15807\/jorsj.34.354","volume":"34","author":"H Kise","year":"1991","unstructured":"Kise, H. (1991). On an automated two-machine flowshop scheduling problem with infinite buffer. Journal of the Operations Research Society of Japan, 34(3), 354\u2013361.","journal-title":"Journal of the Operations Research Society of Japan"},{"issue":"1","key":"762_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ipl.2015.09.003","volume":"116","author":"Y Lan","year":"2016","unstructured":"Lan, Y., Han, X., Wu, Z., Guo, H., & Chen, X. (2016). Complexity of problem $$tf2| v= 1, c= 2| c_{max}$$. Information Processing Letters, 116(1), 65\u201369.","journal-title":"Information Processing Letters"},{"issue":"1","key":"762_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","volume":"4","author":"CY Lee","year":"2001","unstructured":"Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4(1), 3\u201324.","journal-title":"Journal of Scheduling"},{"issue":"6","key":"762_CR13","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts, C. N. (1980). Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research, 28(6), 1436\u20131441.","journal-title":"Operations Research"},{"issue":"5","key":"762_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1992","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1992). Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of the Operational Research Society, 43(5), 395\u2013406.","journal-title":"Journal of the Operational Research Society"},{"issue":"3\u20134","key":"762_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01324886","volume":"4","author":"SP Sethi","year":"1992","unstructured":"Sethi, S. P., Sriskandarajah, C., Sorger, G., Blazewicz, J., & Kubiak, W. (1992). Sequencing of parts and robot moves in a robotic cell. International Journal of Flexible Manufacturing Systems, 4(3\u20134), 331\u2013358.","journal-title":"International Journal of Flexible Manufacturing Systems"},{"doi-asserted-by":"crossref","unstructured":"Su, C. S., Pan, C. H., & Hsu, T. S. (2009). A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theoretical Computer Science, 410(27), 2581\u20132591.","key":"762_CR16","DOI":"10.1016\/j.tcs.2009.02.019"},{"issue":"1","key":"762_CR17","first-page":"38","volume":"17","author":"L Wang","year":"2013","unstructured":"Wang, L., & Liu, Z. (2013). An improved algorithm for scheduling two identical machines with batch delivery consideration. Operations Research Transactions, 17(1), 38\u201343.","journal-title":"Operations Research Transactions"},{"doi-asserted-by":"crossref","unstructured":"Wang, Y., Lan, Y., Chen, X., Han, X., & Piao, Y. (2020). A tight approximation algorithm for problem $$ p2 \\rightarrow d | v=1,c=1 | c_{\\max }$$. Journal of Combinatorial Optimization, pp. 1\u201312.","key":"762_CR18","DOI":"10.1007\/s10878-020-00593-1"},{"issue":"4","key":"762_CR19","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster, S., & Baker, K. R. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43(4), 692\u2013703.","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Woeginger, G. J. (1994). Heuristics for parallel machine scheduling with delivery times. Acta Informatica, 31(6), 503\u2013512.","key":"762_CR20","DOI":"10.1007\/BF01213203"},{"doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zheng, Q., Ren, J., & Zhang, L. (2015). An improved algorithm for the machine scheduling problem with job delivery coordination. In 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015), pp. 167\u2013172","key":"762_CR21","DOI":"10.1049\/cp.2015.0620"},{"issue":"3","key":"762_CR22","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.ejor.2006.09.059","volume":"182","author":"W Zhong","year":"2007","unstructured":"Zhong, W., D\u00f3sa, G., & Tan, Z. (2007). On the machine scheduling problem with job delivery coordination. European Journal of Operational Research, 182(3), 1057\u20131072.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00762-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00762-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00762-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T08:10:31Z","timestamp":1701072631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00762-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,2]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["762"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00762-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2022,11,2]]},"assertion":[{"value":"19 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}