{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T18:05:10Z","timestamp":1767204310205,"version":"3.48.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11235-025-01368-x","type":"journal-article","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T11:50:49Z","timestamp":1762257049000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TS-JRST: TaS-oriented joint routing and scheduling technique for industrial time-sensitive networks"],"prefix":"10.1007","volume":"88","author":[{"given":"Chang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Sr.","given":"Chang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiangpei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,4]]},"reference":[{"key":"1368_CR1","doi-asserted-by":"crossref","unstructured":"Liu, Y., Cheng, Z., Ren, J., et al. (2022). Joint routing and scheduling for CQF. In The 7th IEEE international conference on computer and communication systems (pp. 1\u20135).","DOI":"10.1109\/ICCCS55155.2022.9846349"},{"issue":"3","key":"1368_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search\u2014Part I. ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"1368_CR3","doi-asserted-by":"publisher","first-page":"37855","DOI":"10.1109\/ACCESS.2020.2974580","volume":"8","author":"Q Yu","year":"2020","unstructured":"Yu, Q., & Gu, M. (2020). Adaptive group routing and scheduling in multicast time-sensitive networks. IEEE Access, 8, 37855\u201337865.","journal-title":"IEEE Access"},{"issue":"3","key":"1368_CR4","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TII.2020.2998224","volume":"17","author":"Z Pang","year":"2020","unstructured":"Pang, Z., Huang, X., Li, Z., et al. (2020). Flow scheduling for conflict-free network updates in time-sensitive software-defined networks. IEEE Transactions on Industrial Informatics, 17(3), 1668\u20131678.","journal-title":"IEEE Transactions on Industrial Informatics"},{"issue":"1","key":"1368_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13673-020-00226-w","volume":"10","author":"W Li","year":"2020","unstructured":"Li, W., Ding, Y., Yang, Y., et al. (2020). Parameterized algorithms of fundamental NP-hard problems: A survey. Human-Centric Computing and Information Sciences, 10(1), 1\u201324.","journal-title":"Human-Centric Computing and Information Sciences"},{"issue":"11","key":"1368_CR6","doi-asserted-by":"publisher","first-page":"4153","DOI":"10.3390\/s22114153","volume":"22","author":"L Xu","year":"2022","unstructured":"Xu, L., Li, Y., Yin, Z., Ma, Y., et al. (2022). Heuristic routing algorithms for time-sensitive networks in smart factories. Sensors, 22(11), 4153.","journal-title":"Sensors"},{"issue":"2","key":"1368_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCOMSTD.2018.1700047","volume":"2","author":"JL Messenger","year":"2018","unstructured":"Messenger, J. L. (2018). Time-sensitive networking: An introduction. IEEE Communications Standards Magazine, 2(2), 29\u201333.","journal-title":"IEEE Communications Standards Magazine"},{"key":"1368_CR8","doi-asserted-by":"crossref","unstructured":"Steiner, W. (2010). An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks. In The 31st IEEE real-time systems symposium (pp. 375\u2013384).","DOI":"10.1109\/RTSS.2010.25"},{"key":"1368_CR9","doi-asserted-by":"crossref","unstructured":"Oliver, R. S., Craciunas, S. S., & Steiner, W. (2018). IEEE 802.1 Qbv gate control list synthesis using array theory encoding. In 2018 IEEE real-time and embedded technology and applications symposium (pp. 13\u201324).","DOI":"10.1109\/RTAS.2018.00008"},{"key":"1368_CR10","doi-asserted-by":"crossref","unstructured":"D\u00fcrr, F., & Nayak, N. G. (2016). No-wait packet scheduling for IEEE time-sensitive networks (TSN). In Proceedings of the 24th international conference on real-time networks and systems (pp. 203\u2013212).","DOI":"10.1145\/2997465.2997494"},{"issue":"2","key":"1368_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.3390\/electronics10020157","volume":"10","author":"HJ Kim","year":"2021","unstructured":"Kim, H. J., Choi, M. H., Kim, M. H., et al. (2021). Development of an ethernet-based heuristic time-sensitive networking scheduling algorithm for real-time in-vehicle data transmission. Electronics, 10(2), 157.","journal-title":"Electronics"},{"key":"1368_CR12","doi-asserted-by":"crossref","unstructured":"Kim, H. J., Lee, K. C., Lee, S. (2021). A genetic algorithm based scheduling method for automotive Ethernet. In IECON 2021\u201347th annual conference of the IEEE Industrial Electronics Society (pp. 1\u20135).","DOI":"10.1109\/IECON48115.2021.9589998"},{"issue":"6","key":"1368_CR13","doi-asserted-by":"publisher","first-page":"926","DOI":"10.3390\/electronics11060926","volume":"11","author":"HJ Kim","year":"2022","unstructured":"Kim, H. J., Lee, K. C., Kim, M. H., et al. (2022). Optimal scheduling of time-sensitive networks for automotive ethernet based on genetic algorithm. Electronics, 11(6), 926.","journal-title":"Electronics"},{"key":"1368_CR14","doi-asserted-by":"crossref","unstructured":"Schweissguth, E., Danielis, P., Timmermann, D., et al. (2017). ILP-based joint routing and scheduling for time-triggered networks. In Proceedings of the 25th international conference on real-time networks and systems (pp. 8\u201317).","DOI":"10.1145\/3139258.3139289"},{"key":"1368_CR15","doi-asserted-by":"crossref","unstructured":"Falk, J., D\u00fcrr, F., Rothermel, K. (2018). Exploring practical limitations of joint routing and scheduling for TSN with ILP. In 2018 IEEE 24th international conference on embedded and real-time computing systems and applications (pp. 136\u2013146).","DOI":"10.1109\/RTCSA.2018.00025"},{"issue":"7","key":"1368_CR16","doi-asserted-by":"publisher","first-page":"4525","DOI":"10.1109\/TII.2019.2950887","volume":"16","author":"AA Atallah","year":"2019","unstructured":"Atallah, A. A., Hamad, G. B., & Mohamed, O. A. (2019). Routing and scheduling of time-triggered traffic in time-sensitive networks. IEEE Transactions on Industrial Informatics, 16(7), 4525\u20134534.","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"1368_CR17","doi-asserted-by":"crossref","unstructured":"Huang, Y., Wang, S., Huang, T., et al. (2021). Online routing and scheduling for time-sensitive networks. In 2021 IEEE 41st international conference on distributed computing systems (pp. 272\u2013281).","DOI":"10.1109\/ICDCS51616.2021.00034"},{"key":"1368_CR18","doi-asserted-by":"crossref","unstructured":"Xu, L., Xu, Q., Zhang, Y., et al. (2020). The co-design approach of scheduling and routing in time-sensitive networking. In 2020 IEEE conference on industrial cyberphysical systems, 2020 (Vol. 1, pp. 111\u2013116).","DOI":"10.1109\/ICPS48405.2020.9274702"},{"key":"1368_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43024-5_7","volume-title":"Measurement, modelling and evaluation of computing systems. MMB 2020. Lecture notes in computer science","author":"A Arestova","year":"2020","unstructured":"Arestova, A., Hielscher, K. S. J., & German, R. (2020). Design of a hybrid genetic algorithm for time-sensitive networking. In H. Hermanns (Ed.), Measurement, modelling and evaluation of computing systems. MMB 2020. Lecture notes in computer science.  (Vol. 12040). Cham: Springer. https:\/\/doi.org\/10.1007\/978-3-030-43024-5_7"},{"key":"1368_CR20","doi-asserted-by":"publisher","unstructured":"Wang, Z., et al. (2024). Joint routing and scheduling optimization with swarm intelligence in time-sensitive networking. In IEEE 99th vehicular technology conference (VTC2024-Spring), 24\u201327 June 2024. https:\/\/doi.org\/10.1109\/VTC2024-Spring62846.2024.10682998.","DOI":"10.1109\/VTC2024-Spring62846.2024.10682998"},{"issue":"7","key":"1368_CR21","doi-asserted-by":"publisher","first-page":"11779","DOI":"10.1109\/JIOT.2023.3331430","volume":"11","author":"J Min","year":"2023","unstructured":"Min, J., Kim, W., & Paek, J. (2023). Co-optimization framework for heterogeneous search spaces in time-sensitive network planning. IEEE Internet of Things Journal, 11(7), 11779\u201311792.","journal-title":"IEEE Internet of Things Journal"},{"key":"1368_CR22","doi-asserted-by":"publisher","unstructured":"Zhou, H., et al. (2024). Hybrid heuristic optimization for joint routing and scheduling in time-sensitive networking. In 20th International conference on mobility, sensing and networking (MSN). IEEE Computer Society, 20\u201322 December 2024. https:\/\/doi.org\/10.1109\/MSN63567.2024.00048.","DOI":"10.1109\/MSN63567.2024.00048"},{"issue":"4","key":"1368_CR23","doi-asserted-by":"publisher","first-page":"7093","DOI":"10.1109\/JIOT.2023.3315286","volume":"11","author":"W Sun","year":"2023","unstructured":"Sun, W., et al. (2023). Joint routing and scheduling optimization of in-vehicle time-sensitive networks based on improved grey wolf optimizer. IEEE Internet of Things Journal, 11(4), 7093\u20137106. https:\/\/doi.org\/10.1109\/JIOT.2023.3315286","journal-title":"IEEE Internet of Things Journal"},{"key":"1368_CR24","doi-asserted-by":"crossref","unstructured":"Pahlevan, M., & Obermaisser, R. (2018). Genetic algorithm for scheduling time-triggered traffic in time-sensitive networks. In 2018 IEEE 23rd international conference on emerging technologies and factory automation (Vol. 1, pp. 337\u2013344).","DOI":"10.1109\/ETFA.2018.8502515"},{"issue":"19","key":"1368_CR25","doi-asserted-by":"publisher","first-page":"18663","DOI":"10.1109\/JIOT.2022.3163411","volume":"9","author":"Y Li","year":"2022","unstructured":"Li, Y., Jiang, J., & Hong, S. H. (2022). Joint traffic routing and scheduling algorithm eliminating the nondeterministic interruption for TSN networks used in IIoT. IEEE Internet of Things Journal, 9(19), 18663\u201318680.","journal-title":"IEEE Internet of Things Journal"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-025-01368-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-025-01368-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-025-01368-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T18:03:06Z","timestamp":1767204186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-025-01368-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,4]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1368"],"URL":"https:\/\/doi.org\/10.1007\/s11235-025-01368-x","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2025,11,4]]},"assertion":[{"value":"7 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"138"}}