{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T07:50:40Z","timestamp":1765871440454,"version":"3.48.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100017700","name":"Henan Provincial Science and Technology Research Project","doi-asserted-by":"publisher","award":["222102310547"],"award-info":[{"award-number":["222102310547"]}],"id":[{"id":"10.13039\/501100017700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["242300421474"],"award-info":[{"award-number":["242300421474"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]},{"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":["CCF Trans. HPC"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s42514-025-00243-0","type":"journal-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T17:37:38Z","timestamp":1762364258000},"page":"623-631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new approximation algorithm for two-machine flow shop scheduling with transporter coordinate"],"prefix":"10.1007","volume":"7","author":[{"given":"Yinling","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yuping","family":"Ge","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2646-4194","authenticated-orcid":false,"given":"Yubai","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"issue":"1","key":"243_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.ejor.2014.03.039","volume":"238","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Aloulou, M.A., Fu, L.-L.: Coordination of production and interstage batch delivery with outsourced distribution. Eur. J. Oper. Res. 238(1), 130\u2013142 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"243_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ejor.2021.04.020","volume":"297","author":"D Bachtenkirch","year":"2022","unstructured":"Bachtenkirch, D., Bock, S.: Finding efficient make-to-order production and batch delivery schedules. Eur. J. Oper. Res. 297(1), 133\u2013152 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"243_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jda.2006.07.005","volume":"6","author":"W Chan","year":"2008","unstructured":"Chan, W., Chin, F.Y., Ye, D., Zhang, G., Zhang, Y.: On-line scheduling of parallel jobs on two machines. J. Discrete Algorithms 6(1), 3\u201310 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"243_CR4","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.: Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158(2), 470\u2013487 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"243_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0377-2217(95)00133-6","volume":"93","author":"Z-L Chen","year":"1996","unstructured":"Chen, Z.-L.: Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur. J. Oper. Res. 93(1), 49\u201360 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"243_CR6","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"Z-L Chen","year":"2010","unstructured":"Chen, Z.-L.: Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58(1), 130\u2013148 (2010)","journal-title":"Oper. Res."},{"issue":"2","key":"243_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0377-2217(96)00127-0","volume":"94","author":"TE Cheng","year":"1996","unstructured":"Cheng, T.E., Gordon, V.S., Kovalyov, M.Y.: Single machine scheduling with batch deliveries. Eur. J. Oper. Res. 94(2), 277\u2013283 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"243_CR8","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1007\/s10878-014-9825-y","volume":"31","author":"J Dong","year":"2016","unstructured":"Dong, J., Wang, X., Hu, J., et al.: An improved two-machine flowshop scheduling with intermediate transportation. J. Comb. Optim. 31(3), 1316\u20131334 (2016)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"243_CR9","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez de La Vega","year":"1981","unstructured":"Fernandez de La Vega, W., Lueker, G.S.: Bin packing can be solved within 1+$$\\varepsilon$$ in linear time. Combinatorica 1(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"issue":"2","key":"243_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.033","volume":"273","author":"JM Framinan","year":"2019","unstructured":"Framinan, J.M., Perez-Gonzalez, P., Fernandez-Viagas, V.: Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures. Eur. J. Oper. Res. 273(2), 401\u2013417 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"243_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF01585870","volume":"82","author":"LA Hall","year":"1998","unstructured":"Hall, L.A.: Approximability of flow shop scheduling. Math. Program. 82(1), 175\u2013190 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"243_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"LA Hall","year":"1992","unstructured":"Hall, L.A., Shmoys, D.B.: Jackson\u2019s rule for single-machine scheduling: making a good heuristic better. Math. Oper. Res. 17(1), 22\u201335 (1992)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"243_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ipl.2008.10.002","volume":"109","author":"X Han","year":"2009","unstructured":"Han, X., Guo, H., Yin, D., Zhang, Y.: A note on on-line broadcast scheduling with deadlines. Inf. Process. Lett. 109(3), 204\u2013207 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"243_CR14","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","volume":"70","author":"JW Herrmann","year":"1993","unstructured":"Herrmann, J.W., Lee, C.: On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date. Eur. J. Oper. Res. 70(3), 272\u2013288 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"243_CR15","doi-asserted-by":"crossref","unstructured":"Hoberg, R., Rothvoss, T.: A logarithmic additive integrality gap for bin packing. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2616\u20132625 (2017)","DOI":"10.1137\/1.9781611974782.172"},{"issue":"6","key":"243_CR16","doi-asserted-by":"publisher","first-page":"902","DOI":"10.26599\/TST.2021.9010092","volume":"27","author":"P Huang","year":"2022","unstructured":"Huang, P., Guo, L., Sun, L., Zhang, X.: A two-stage method for routing in field-programmable gate arrays with time-division multiplexing. Tsinghua Sci. Technol. 27(6), 902\u2013911 (2022)","journal-title":"Tsinghua Sci. Technol."},{"key":"243_CR17","doi-asserted-by":"crossref","unstructured":"Jansen, K., Solis-Oba, R.: An OPT+1 algorithm for the cutting stock problem with constant number of object lengths. In: Integer Programming and Combinatorial Optimization, pp. 438\u2013449 (2010)","DOI":"10.1007\/978-3-642-13036-6_33"},{"key":"243_CR18","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: 23rd Annual Symposium on Foundations of Computer Science, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"243_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_8","volume-title":"Reducibility Among Combinatorial Problems","author":"RM Karp","year":"2010","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Springer, Berlin (2010)"},{"key":"243_CR20","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.engappai.2017.05.004","volume":"63","author":"H Kazemi","year":"2017","unstructured":"Kazemi, H., Mazdeh, M.M., Rostami, M.: The two stage assembly flow-shop scheduling problem with batching and delivery. Eng. Appl. Artif. Intell. 63, 98\u2013107 (2017)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"243_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2017.01.018","volume":"670","author":"Y Lan","year":"2017","unstructured":"Lan, Y., Han, X., Wang, Y., et al.: Flowshop problem $$F2 \\rightarrow D| v= 1, c \\ge 1| C_{max}$$ revisited. Theoret. Comput. Sci. 670, 79\u201385 (2017)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"243_CR22","first-page":"828","volume":"37","author":"Y Lan","year":"2017","unstructured":"Lan, Y., Wang, Y., Guo, H.: Optimal algorithms for flow shop schedule with transporter. J. Syst. Sci. Math. Sci. 37(3), 828 (2017)","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"243_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114349","volume":"985","author":"Y Lan","year":"2024","unstructured":"Lan, Y., Yuan, Y., Wang, Y., Han, X., Zhou, Y.: Flow shop scheduling problems with transportation constraints revisited. Theoret. Comput. Sci. 985, 114349 (2024)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"243_CR24","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.: Machine scheduling with transportation considerations. J. Sched. 4(1), 3\u201324 (2001)","journal-title":"J. Sched."},{"key":"243_CR25","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s11590-015-0881-8","volume":"10","author":"G Li","year":"2016","unstructured":"Li, G., Lu, X.: Approximation algorithms for the single-machine scheduling with a period of maintenance. Optim. Lett. 10, 543\u2013562 (2016)","journal-title":"Optim. Lett."},{"issue":"1","key":"243_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217595908001596","volume":"25","author":"L Lu","year":"2008","unstructured":"Lu, L., Yuan, J.: Single machine scheduling with job delivery to minimize makespan. Asia-Pac. J. Oper. Res. 25(1), 1\u201310 (2008)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"4","key":"243_CR27","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1051\/ro\/2018097","volume":"53","author":"L Lu","year":"2019","unstructured":"Lu, L., Zhang, L.: A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan. RAIRO-Oper. Res. 53(4), 1261\u20131266 (2019)","journal-title":"RAIRO-Oper. Res."},{"issue":"6","key":"243_CR28","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.: Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper. Res. 28(6), 1436\u20131441 (1980)","journal-title":"Oper. Res."},{"key":"243_CR29","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: Approximating bin packing within O (log OPT\u00b7 log log OPT) bins. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 20\u201329 (2013)","DOI":"10.1109\/FOCS.2013.11"},{"issue":"27\u201329","key":"243_CR30","doi-asserted-by":"publisher","first-page":"2581","DOI":"10.1016\/j.tcs.2009.02.019","volume":"410","author":"C-S Su","year":"2009","unstructured":"Su, C.-S., Pan, J.C.-H., Hsu, T.-S.: A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theoret. Comput. Sci. 410(27\u201329), 2581\u20132591 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"243_CR31","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: Speeding-up linear programming using fast matrix multiplication. In: 30th Annual Symposium on Foundations of Computer Science, pp. 332\u2013337 (1989)","DOI":"10.1109\/SFCS.1989.63499"},{"key":"243_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105105","volume":"126","author":"G Wang","year":"2021","unstructured":"Wang, G.: Integrated supply chain scheduling of procurement, production, and distribution under spillover effects. Comput. Oper. Res. 126, 105105 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"243_CR33","doi-asserted-by":"publisher","first-page":"2195","DOI":"10.1007\/s10878-020-00593-1","volume":"44","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Lan, Y., Chen, X., Han, X., Piao, Y.: A tight approximation algorithm for problem $$P2 \\rightarrow D| v= 1, c= 1| C_{max}$$. J. Comb. Optim. 44(4), 2195\u20132206 (2022)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"243_CR34","first-page":"38","volume":"17","author":"L Wang","year":"2013","unstructured":"Wang, L., Liu, Z.: An improved algorithm for scheduling two identical machines with batch delivery consideration. Oper. Res. Trans. 17(1), 38\u201343 (2013)","journal-title":"Oper. Res. Trans."},{"issue":"5","key":"243_CR35","doi-asserted-by":"publisher","first-page":"916","DOI":"10.26599\/TST.2022.9010052","volume":"28","author":"W Yu","year":"2023","unstructured":"Yu, W., Liao, Y., Yang, Y.: Exact and approximation algorithms for the multi-depot capacitated arc routing problems. Tsinghua Sci. Technol. 28(5), 916\u2013928 (2023)","journal-title":"Tsinghua Sci. Technol."},{"issue":"5","key":"243_CR36","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1109\/TMC.2020.2971599","volume":"20","author":"D Yu","year":"2020","unstructured":"Yu, D., Zou, Y., Yu, J., Zhang, Y., Li, F., Cheng, X., Dressler, F., Lau, F.C.: Implementing the abstract MAC layer in dynamic networks. IEEE Trans. Mob. Comput. 20(5), 1832\u20131845 (2020)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"1","key":"243_CR37","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0377-2217(95)00168-9","volume":"94","author":"J Yuan","year":"1996","unstructured":"Yuan, J.: A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs. Eur. J. Oper. Res. 94(1), 203\u2013205 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"243_CR38","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.ejor.2005.08.034","volume":"178","author":"J Yuan","year":"2007","unstructured":"Yuan, J., Soukhal, A., Chen, Y., et al.: A note on the complexity of flow shop scheduling with transportation constraints. Eur. J. Oper. Res. 178(3), 918\u2013925 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"243_CR39","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02009683","volume":"7","author":"M Yue","year":"1991","unstructured":"Yue, M.: A simple proof of the inequality $$FFD(L) \\le \\frac{11}{9} OPT (L) + 1, \\forall L$$ for the FFD bin-packing algorithm. Acta Math. Appl. Sin. 7(4), 321\u2013331 (1991)","journal-title":"Acta Math. Appl. Sin."},{"key":"243_CR40","volume-title":"An Improved Algorithm for the Machine Scheduling Problem with Job Delivery Coordination","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y., Zheng, Q., Ren, J., Zhang, L.: An Improved Algorithm for the Machine Scheduling Problem with Job Delivery Coordination. IET, Stevenage (2015)"},{"issue":"3","key":"243_CR41","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.: On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182(3), 1057\u20131072 (2007)","journal-title":"Eur. J. Oper. Res."}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00243-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-025-00243-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00243-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T07:47:23Z","timestamp":1765871243000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-025-00243-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["243"],"URL":"https:\/\/doi.org\/10.1007\/s42514-025-00243-0","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"type":"print","value":"2524-4922"},{"type":"electronic","value":"2524-4930"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"28 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}