{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:32:28Z","timestamp":1765888348689,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T00:00:00Z","timestamp":1591315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T00:00:00Z","timestamp":1591315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["11701062"],"award-info":[{"award-number":["11701062"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971091"],"award-info":[{"award-number":["11971091"]}],"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":[[2022,11]]},"DOI":"10.1007\/s10878-020-00593-1","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T22:02:24Z","timestamp":1591394544000},"page":"2195-2206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A tight approximation algorithm for problem $$P2\\rightarrow D|v=1,c=1|C_{\\max }$$"],"prefix":"10.1007","volume":"44","author":[{"given":"Yinling","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yan","family":"Lan","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Piao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"issue":"2","key":"593_CR1","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/S0377-2217(03)00364-3","volume":"158","author":"Y-C Chang","year":"2004","unstructured":"Chang Y-C, Lee C-Y (2004) Machine scheduling with job delivery coordination. Eur J Oper Res 158(2):470\u2013487","journal-title":"Eur J Oper Res"},{"issue":"1","key":"593_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5(1):287\u2013326","journal-title":"Ann Discrete Math"},{"key":"593_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"G D\u00f3sa","year":"2013","unstructured":"D\u00f3sa G, Li R, Han X, Tuza Z (2013) The tight bound of first fit decreasing bin-packing algorithm is FFD(I) $$< = 11\/9{OPT(I)} + 6\/9$$. Theo Comput Sci 510:13\u201361","journal-title":"Theo Comput Sci"},{"issue":"1","key":"593_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"LA Hall","year":"1992","unstructured":"Hall LA, Shmoys DB (1992) Jackson\u2019s rule for single-machine scheduling: making a good heuristic better. Math Oper Res 17(1):22\u201335","journal-title":"Math Oper Res"},{"issue":"1\u20133","key":"593_CR5","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 Appl Math 112(1\u20133):199\u2013216","journal-title":"Discrete Appl Math"},{"key":"593_CR6","first-page":"1","volume-title":"Bin packing","author":"DS Johnson","year":"2008","unstructured":"Johnson DS (2008) Bin packing. Springer, Boston, pp 1\u201399"},{"issue":"4","key":"593_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers AJ, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4):299\u2013325","journal-title":"SIAM J Comput"},{"key":"593_CR8","first-page":"354","volume":"34","author":"H Kise","year":"1991","unstructured":"Kise H (1991) On an automated two-machine flowshop scheduling problem with infinite buffer. J Oper Res Soc Jpn 34:354\u2013361","journal-title":"J Oper Res Soc Jpn"},{"issue":"1","key":"593_CR9","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, Zongtao W, Guo H, Chen X (2016) Complexity of problem TF2 $$\\vert v=1, c=2\\vert c_{\\text{ max }}$$. Inf Process Lett 116(1):65\u201369","journal-title":"Inf Process Lett"},{"issue":"1","key":"593_CR10","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":"C-Y Lee","year":"2001","unstructured":"Lee C-Y, Chen Z-L (2001) Machine scheduling with transportation considerations. J Sched 4(1):3\u201324","journal-title":"J Sched"},{"issue":"1","key":"593_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2003.11.022","volume":"164","author":"C-L Li","year":"2005","unstructured":"Li C-L, Vairaktarakis G, Lee C-Y (2005) Machine scheduling with deliveries to multiple customer locations. Eur J Oper Res 164(1):39\u201351","journal-title":"Eur J Oper Res"},{"issue":"6","key":"593_CR12","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts CN (1980) Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper Res 28(6):1436\u20131441","journal-title":"Oper Res"},{"issue":"2","key":"593_CR13","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120(2):228\u2013249","journal-title":"Eur J Oper Res"},{"issue":"5","key":"593_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1992","unstructured":"Potts CN, Van Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43(5):395\u2013406","journal-title":"J Oper Res Soc"},{"issue":"27","key":"593_CR15","doi-asserted-by":"publisher","first-page":"2581","DOI":"10.1016\/j.tcs.2009.02.019","volume":"410","author":"CS Su","year":"2009","unstructured":"Su CS, Pan CH, Hsu TS (2009) A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theor Comput Sci 410(27):2581\u20132591","journal-title":"Theor Comput Sci"},{"issue":"1","key":"593_CR16","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. Oper Res Trans 17(1):38\u201343","journal-title":"Oper Res Trans"},{"issue":"4","key":"593_CR17","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 KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43(4):692\u2013703","journal-title":"Oper Res"},{"issue":"6","key":"593_CR18","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01213203","volume":"31","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger GJ (1994) Heuristics for parallel machine scheduling with delivery times. Acta Inf 31(6):503\u2013512","journal-title":"Acta Inf"},{"key":"593_CR19","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"},{"issue":"3","key":"593_CR20","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. Eur J Oper Res 182(3):1057\u20131072","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00593-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00593-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00593-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:17:19Z","timestamp":1665778639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00593-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,5]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00593-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,6,5]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}