{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:06:19Z","timestamp":1757311579281,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"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":["J Sched"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10951-024-00813-0","type":"journal-article","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T20:21:41Z","timestamp":1721161301000},"page":"461-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling periodic messages on a shared link without buffering"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0497-6233","authenticated-orcid":false,"given":"Ma\u00ebl","family":"Guiraud","sequence":"first","affiliation":[]},{"given":"Yann","family":"Strozecki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"813_CR1","unstructured":"3GPP: 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Service Requirements for the 5G System;. 3GPP. Stage 1 (Release 16)."},{"issue":"4","key":"813_CR2","doi-asserted-by":"publisher","first-page":"4799","DOI":"10.1007\/s11227-021-04050-6","volume":"78","author":"F Alkhateeb","year":"2022","unstructured":"Alkhateeb, F., Abed-alguni, B. H., & Al-rousan, M. H. (2022). Discrete hybrid cuckoo search and simulated annealing algorithm for solving the job shop scheduling problem. The Journal of Supercomputing, 78(4), 4799\u20134826.","journal-title":"The Journal of Supercomputing"},{"issue":"5","key":"813_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.dam.2009.10.012","volume":"158","author":"P Baptiste","year":"2010","unstructured":"Baptiste, P. (2010). A note on scheduling identical coupled tasks in logarithmic time. Discrete Applied Mathematics, 158(5), 583\u2013587.","journal-title":"Discrete Applied Mathematics"},{"key":"813_CR4","doi-asserted-by":"crossref","unstructured":"Barth, D., Guiraud, M. & Strozecki, Y. (2018). Deterministic scheduling of periodic messages for low latency in Cloud RAN. arXiv preprint arXiv:1801.07029.","DOI":"10.1109\/ICT.2018.8464890"},{"key":"813_CR5","doi-asserted-by":"crossref","unstructured":"Barth, D., Guiraud, M. & Strozecki, Y. (2019). Deterministic contention management for low latency cloud RAN over an optical ring. In ONDM 2019 - 23rd international conference on optical network design and modeling (ONDM 2019).","DOI":"10.1007\/978-3-030-38085-4_41"},{"key":"813_CR6","doi-asserted-by":"crossref","unstructured":"Barth, D., Guiraud, M., Leclerc, B., Marc\u00e9, O. & Strozecki, Y. (2018). Deterministic scheduling of periodic messages for Cloud RAN. In 2018 25th international conference on telecommunications (ICT) (pp. 405\u2013410). IEEE.","DOI":"10.1109\/ICT.2018.8464890"},{"key":"813_CR7","doi-asserted-by":"crossref","unstructured":"Bhatia, R., Lakshman, T. V., \u00d6zko\u00e7, M. F. & Panwar, S. (2021). Flowtoss: Fast wait-free scheduling of deterministic flows in time synchronized networks. In 2021 IFIP networking conference (IFIP Networking) (pp. 1\u20136).","DOI":"10.23919\/IFIPNetworking52078.2021.9472838"},{"key":"813_CR8","unstructured":"Bouguen, Y., Hardouin, E., Maloberti, A., & Wolff, F.-X. (2012). LTE et les R\u00e9seaux 4G. Editions Eyrolles."},{"issue":"1","key":"813_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/COMST.2014.2355255","volume":"17","author":"A Checko","year":"2014","unstructured":"Checko, A., Christiansen, H. L., Yan, Y., Scolari, L., Kardaras, G., Berger, M. S., & Dittmann, L. (2014). Cloud RAN for mobile networks: A technology overview. IEEE Communications Surveys & Tutorials, 17(1), 405\u2013426.","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"2","key":"813_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10951-020-00668-1","volume":"24","author":"B Chen","year":"2021","unstructured":"Chen, B., & Zhang, X. (2021). Scheduling coupled tasks with exact delays for minimum total job completion time. Journal of Scheduling, 24(2), 209\u2013221.","journal-title":"Journal of Scheduling"},{"key":"813_CR11","doi-asserted-by":"publisher","first-page":"67512","DOI":"10.1109\/ACCESS.2020.3031234","volume":"9","author":"A Dogra","year":"2020","unstructured":"Dogra, A., Jha, R. K., & Jain, S. (2020). A survey on beyond 5G network with the advent of 6G: Architecture and emerging technologies. IEEE Access, 9, 67512\u201367547.","journal-title":"IEEE Access"},{"key":"813_CR12","doi-asserted-by":"crossref","unstructured":"dos Santos, A. C. T., Schneider, B. & Nigam, V. (2019). TSNSCHED: Automated Schedule Generation for Time Sensitive Networking. In 2019 formal methods in computer aided design (FMCAD) (pp. 69\u201377). IEEE.","DOI":"10.23919\/FMCAD.2019.8894249"},{"key":"813_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2023.109606","volume":"224","author":"C G\u00e4rtner","year":"2023","unstructured":"G\u00e4rtner, C., Rizk, A., Koldehofe, B., Guillaume, R., Kundel, R., & Steinmetz, R. (2023). Fast incremental reconfiguration of dynamic time-sensitive networks at runtime. Computer Networks, 224, 109606.","journal-title":"Computer Networks"},{"issue":"3","key":"813_CR14","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1007\/s11277-020-07231-3","volume":"113","author":"L Gavrilovska","year":"2020","unstructured":"Gavrilovska, L., Rakovic, V., & Denkovski, D. (2020). From Cloud RAN to Open RAN. Wireless Personal Communications, 113(3), 1523\u20131539.","journal-title":"Wireless Personal Communications"},{"key":"813_CR15","unstructured":"Guiraud, M. & Strozecki, Y. (2020). Scheduling periodic messages on a shared link. CoRR arXiv:2002.07606"},{"key":"813_CR16","unstructured":"Guiraud, M. (2021). Deterministic scheduling of periodic datagrams for low latency in 5G and beyond. PhD thesis, Universit\u00e9 Paris-Saclay. https:\/\/tel.archives-ouvertes.fr\/tel-03413419."},{"key":"813_CR17","doi-asserted-by":"crossref","unstructured":"Guiraud, M., Leclerc, B. & Marc\u00e9, O. (2022). An experimental platform for hard tsn. In 2022 IEEE 19th annual consumer communications & networking conference (CCNC) (pp. 913\u2013916). IEEE.","DOI":"10.1109\/CCNC49033.2022.9700643"},{"key":"813_CR18","unstructured":"Hanen, C., & Munier, A. (1993). Cyclic Scheduling on Parallel Processors: an Overview. Laboratoire de Recherche en Informatique, Orsay: Universit\u00e9 de Paris-Sud."},{"key":"813_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jnca.2019.04.019","volume":"139","author":"MF Hossain","year":"2019","unstructured":"Hossain, M. F., Mahin, A. U., Debnath, T., Mosharrof, F. B., & Islam, K. Z. (2019). Recent research in cloud radio access network (c-ran) for 5g cellular systems-a survey. Journal of Network and Computer Applications, 139, 31\u201348.","journal-title":"Journal of Network and Computer Applications"},{"issue":"1","key":"813_CR20","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":"1","key":"813_CR21","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2019.08.045","volume":"282","author":"M Khatami","year":"2020","unstructured":"Khatami, M., Salehipour, A., & Cheng, T. (2020). Coupled task scheduling with exact delays: Literature review and models. European Journal of Operational Research, 282(1), 19\u201339.","journal-title":"European Journal of Operational Research"},{"key":"813_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109456","volume":"183","author":"M Khatami","year":"2023","unstructured":"Khatami, M., Salehipour, A., & Cheng, T. (2023). Flow-shop scheduling with exact delays to minimize makespan. Computers & Industrial Engineering, 183, 109456.","journal-title":"Computers & Industrial Engineering"},{"key":"813_CR23","doi-asserted-by":"crossref","unstructured":"Korst, J., Aarts, E., Lenstra, J. K. & Wessels, J. (1991). Periodic multiprocessor scheduling. In PARLE\u201991 parallel architectures and languages Europe (pp. 166\u2013178). Springer","DOI":"10.1007\/BFb0035103"},{"key":"813_CR24","unstructured":"Leclerc, B. & Marc\u00e9, O. (2016). Transmission of coherent data flow within packet-switched network. Google Patents. EP Patent App. EP20,140,307,006. https:\/\/www.google.com.gt\/patents\/EP3032781A1?cl=en."},{"issue":"02","key":"813_CR25","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1142\/S0129054107004711","volume":"18","author":"JY-T Leung","year":"2007","unstructured":"Leung, J.Y.-T., Li, H., & Zhao, H. (2007). Scheduling two-machine flow shops with exact delays. International Journal of Foundations of Computer Science, 18(02), 341\u2013359.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"813_CR26","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.cie.2010.03.013","volume":"59","author":"E Levner","year":"2010","unstructured":"Levner, E., Kats, V., de Pablo, D. A. L., & Cheng, T. E. (2010). Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers & Industrial Engineering, 59(2), 352\u2013361.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"813_CR27","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1109\/TCYB.2021.3102642","volume":"53","author":"S-C Liu","year":"2023","unstructured":"Liu, S.-C., Chen, Z.-G., Zhan, Z.-H., Jeon, S.-W., Kwong, S., & Zhang, J. (2023). Many-objective job-shop scheduling: A multiple populations for multiple objectives-based genetic algorithm approach. IEEE Transactions on Cybernetics, 53(3), 1460\u20131474. https:\/\/doi.org\/10.1109\/TCYB.2021.3102642","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"1","key":"813_CR28","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C. L., & Layland, J. W. (1973). Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM (JACM), 20(1), 46\u201361.","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"813_CR29","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/s00291-009-0189-0","volume":"33","author":"RM Lusby","year":"2011","unstructured":"Lusby, R. M., Larsen, J., Ehrgott, M., & Ryan, D. (2011). Railway track allocation: Models and methods. OR Spectrum, 33(4), 843\u2013883.","journal-title":"OR Spectrum"},{"key":"813_CR30","unstructured":"Marc\u00e9, O., Leclerc, B. & Guiraud, M. (2018). Coordinated timing syncronization and time-aware shaping. Google Patents. US10743269B2. https:\/\/patents.google.com\/patent\/US10743269B2\/en."},{"key":"813_CR31","unstructured":"Mobile, C. (2011). C-RAN: The road towards green RAN. Technical report. shorturl.at\/hLRSZ"},{"issue":"5","key":"813_CR32","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1109\/TII.2017.2782235","volume":"14","author":"NG Nayak","year":"2017","unstructured":"Nayak, N. G., D\u00fcrr, F., & Rothermel, K. (2017). Incremental flow scheduling and routing in time-sensitive software-defined networks. IEEE Transactions on Industrial Informatics, 14(5), 2066\u20132075.","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"813_CR33","unstructured":"of IEEE\u00a0802.1, T.-S.N.T.G. (2016). Time-sensitive networks for fronthaul. IEEE P802.1\/D0.4."},{"issue":"1\u20132","key":"813_CR34","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(96)00041-8","volume":"72","author":"AJ Orman","year":"1997","unstructured":"Orman, A. J., & Potts, C. N. (1997). On the complexity of coupled-task scheduling. Discrete Applied Mathematics, 72(1\u20132), 141\u2013154.","journal-title":"Discrete Applied Mathematics"},{"key":"813_CR35","doi-asserted-by":"crossref","unstructured":"Polese, M., Bonati, L., D\u2019oro, S., Basagni, S. & Melodia, T. (2023). Understanding o-ran: Architecture, interfaces, algorithms, security, and research challenges. IEEE Communications Surveys & Tutorials.","DOI":"10.1109\/COMST.2023.3239220"},{"key":"813_CR36","doi-asserted-by":"crossref","unstructured":"Romano, G. (2019). IMT-2020 requirements and realization. Wiley 5G Ref: The Essential 5G Reference Online, 1\u201328.","DOI":"10.1002\/9781119471509.w5GRef216"},{"key":"813_CR37","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jpdc.1996.0008","volume":"32","author":"L Schwiebert","year":"1996","unstructured":"Schwiebert, L., & Jayasimha, D. (1996). A necessary and sufficient condition for deadlock-free wormhole routing. Journal of Parallel Distributed Computing, 32, 103\u2013117.","journal-title":"Journal of Parallel Distributed Computing"},{"key":"813_CR38","doi-asserted-by":"crossref","unstructured":"Serafini, P., & Ukovich, W. (1989). A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics, 2(4), 550\u2013581.","DOI":"10.1137\/0402049"},{"key":"813_CR39","doi-asserted-by":"crossref","unstructured":"Shapiro, R. D. (1980). Scheduling coupled tasks. Naval Research Logistics Quarterly, 27(3), 489\u2013498.","DOI":"10.1002\/nav.3800270312"},{"key":"813_CR40","doi-asserted-by":"crossref","unstructured":"Siddiqui, M. U. A., Abumarshoud, H., Bariah, L., Muhaidat, S., Imran, M. A. & Mohjazi, L. (2023). Urllc in beyond 5g and 6g networks: An interference management perspective. IEEE Access.","DOI":"10.1109\/ACCESS.2023.3282363"},{"key":"813_CR41","doi-asserted-by":"crossref","unstructured":"Steiner, W., Craciunas, S. S., & Oliver, R. S. (2018). Traffic planning for time-sensitive communication. IEEE Communications Standards Magazine, 2(2), 42\u201347.","DOI":"10.1109\/MCOMSTD.2018.1700055"},{"key":"813_CR42","unstructured":"Time-Sensitive Networking Task Group. Retrieved 01, October 2023 from https:\/\/www.ieee802.org\/1\/pages\/tsn.html."},{"key":"813_CR43","doi-asserted-by":"crossref","unstructured":"Waseem, Q., Din, W. I. S. W., Aminuddin, A., Mohammed, M. H. & Aziza, R. F. A. (2022). Software-defined networking (sdn): A review. In 2022 5th international conference on information and communications technology (ICOIACT) (pp. 30\u201335). IEEE.","DOI":"10.1109\/ICOIACT55506.2022.9972067"},{"issue":"5","key":"813_CR44","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W Yu","year":"2004","unstructured":"Yu, W., Hoogeveen, H., & Lenstra, J. K. (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7(5), 333\u2013348.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"813_CR45","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1109\/TCYB.2020.3024849","volume":"51","author":"F Zhang","year":"2021","unstructured":"Zhang, F., Mei, Y., Nguyen, S., & Zhang, M. (2021). Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job-shop scheduling. IEEE Transactions on Cybernetics, 51(4), 1797\u20131811.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"813_CR46","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.trb.2019.08.001","volume":"128","author":"Y Zhang","year":"2019","unstructured":"Zhang, Y., Peng, Q., Yao, Y., Zhang, X., & Zhou, X. (2019). Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and alternating direction method of multipliers methods. Transportation Research Part B: Methodological, 128, 344\u2013379.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"11","key":"813_CR47","doi-asserted-by":"publisher","first-page":"5291","DOI":"10.1109\/TCYB.2020.3025662","volume":"51","author":"F Zhao","year":"2020","unstructured":"Zhao, F., He, X., & Wang, L. (2020). A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem. IEEE Transactions on Cybernetics, 51(11), 5291\u20135303.","journal-title":"IEEE Transactions on Cybernetics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00813-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-024-00813-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00813-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:41:22Z","timestamp":1729006882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-024-00813-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["813"],"URL":"https:\/\/doi.org\/10.1007\/s10951-024-00813-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"10 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}