{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T04:13:13Z","timestamp":1777349593455,"version":"3.51.4"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030430238","type":"print"},{"value":"9783030430245","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43024-5_7","type":"book-chapter","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:02:15Z","timestamp":1583712135000},"page":"99-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Design of a Hybrid Genetic Algorithm for Time-Sensitive Networking"],"prefix":"10.1007","author":[{"given":"Anna","family":"Arestova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai-Steffen Jens","family":"Hielscher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"German","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"key":"7_CR1","unstructured":"P802.1AS-Rev - Timing and Synchronization for Time-Sensitive Applications. \nhttps:\/\/1.ieee802.org\/tsn\/802-1as-rev\/\n\n. Accessed 25 Oct 2019"},{"key":"7_CR2","unstructured":"Time-Sensitive Networking (TSN) Task Group. \nhttps:\/\/1.ieee802.org\/tsn\/\n\n. Accessed 25 Oct 2019"},{"key":"7_CR3","unstructured":"IEEE Standard for Local and metropolitan area networks- Timing and Synchronization for Time-Sensitive Applications in Bridged Local Area Networks. IEEE Std 802.1AS-2011 pp. 1\u2013292, March 2011"},{"key":"7_CR4","unstructured":"IEEE Standard for Local and metropolitan area networks - Bridges and Bridged Networks - Amendment 25: Enhancements for Scheduled Traffic. IEEE Std 802.1Qbv-2015 (Amendment to IEEE Std 802.1Q-2014 as amended by IEEE Std 802.1Qca-2015, IEEE Std 802.1Qcd-2015, and IEEE Std 802.1Q-2014\/Cor 1\u20132015) pp. 1\u201357, March 2016"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.sbspro.2012.09.138","volume":"62","author":"B Ak","year":"2012","unstructured":"Ak, B., Koc, E.: A guide for genetic algorithm based on parallel machine scheduling and flexible job-shop scheduling. Proc. - Soc. Behav. Sci. 62, 817\u2013823 (2012). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877042812035793\n\n. World Conference on Business, Economics and Management (BEM-2012), May 4\u20136 2012, Antalya, Turkey","journal-title":"Proc. - Soc. Behav. Sci."},{"key":"7_CR6","first-page":"774","volume":"06","author":"E Anand","year":"2016","unstructured":"Anand, E., Panneerselvam, R.: A study of crossover operators for genetic algorithm and proposal of a new crossover operator to solve open shop scheduling problem. Am. J. Ind. Bus. Manage. 06, 774\u2013789 (2016)","journal-title":"Am. J. Ind. Bus. Manage."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1524\/auto.52.4.151.29416","volume":"52","author":"M Buttelmann","year":"2004","unstructured":"Buttelmann, M., Lohmann, B.: Optimierung mit genetischen algorithmen und eine anwendung zur modellreduktion (optimization with genetic algorithms and an application for model reduction). At-automatisierungstechnik - AT-AUTOM 52, 151\u2013163 (2004)","journal-title":"At-automatisierungstechnik - AT-AUTOM"},{"key":"7_CR8","unstructured":"Chen, H., Ihlow, J., Lehmann, C.: A genetic algorithm for flexible job-shop scheduling. In: Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), vol. 2, pp. 1120\u20131125, May 1999"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Craciunas, S.S., Oliver, R.S., Chmel\u00edk, M., Steiner, W.: Scheduling real-time communication in IEEE 802.1Qbv time sensitive networks. In: Proceedings of the 24th International Conference on Real-Time Networks and Systems, RTNS 2016, pp. 183\u2013192. ACM, New York (2016)","DOI":"10.1145\/2997465.2997470"},{"key":"7_CR10","unstructured":"Craciunas, S.S., Serna Oliver, R.: An overview of scheduling mechanisms for time-sensitive networks. In: Proceedings of the Real-time summer school L\u2019\u00c9cole d\u2019\u00c9t\u00e9 Temps R\u00e9el (ETR) (2017)"},{"key":"7_CR11","unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, IJCAI 1985, vol. 1, pp. 162\u2013164. Morgan Kaufmann Publishers Inc., San Francisco (1985). \nhttp:\/\/dl.acm.org\/citation.cfm?id=1625135.1625164"},{"key":"7_CR12","unstructured":"De Jong, K.: An analysis of the behavior of a class of genetic adaptive systems (1975). \nhttps:\/\/books.google.de\/books?id=4b9bNQcL6wMC"},{"issue":"13","key":"7_CR13","doi-asserted-by":"publisher","first-page":"3905","DOI":"10.1080\/00207543.2014.889328","volume":"52","author":"Y Demir","year":"2014","unstructured":"Demir, Y., \u0130\u015fleyen, S.K.: An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations. Int. J. Prod. Res. 52(13), 3905\u20133921 (2014). \nhttps:\/\/doi.org\/10.1080\/00207543.2014.889328","journal-title":"Int. J. Prod. Res."},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"D\u00fcrr, F., Nayak, N.G.: No-wait packet scheduling for IEEE time-sensitive networks (TSN). In: Proceedings of the 24th International Conference on Real-Time Networks and Systems, RTNS 2016, pp. 203\u2013212. ACM, New York (2016). \nhttps:\/\/doi.org\/10.1145\/2997465.2997494","DOI":"10.1145\/2997465.2997494"},{"key":"7_CR15","unstructured":"Falkenauer, E., Bouffouix, S.: A genetic algorithm for job shop. In: Proceedings of the 1991 IEEE International Conference on Robotics and Automation, pp. 824\u2013829 (1991)"},{"key":"7_CR16","unstructured":"Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of Genetic Algorithms, vol. 1, pp. 69\u201393. Elsevier (1991). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780080506845500082"},{"key":"7_CR17","unstructured":"Goldberg, D.E., Lingle Jr., R.: Alleles, loci and the traveling salesman problem. In: Proceedings of the 1st International Conference on Genetic Algorithms, pp. 154\u2013159. L. Erlbaum Associates Inc., Hillsdale (1985). \nhttp:\/\/dl.acm.org\/citation.cfm?id=645511.657095"},{"key":"7_CR18","unstructured":"Gonz\u00e1lez Fern\u00e1ndez, M.N., Vela, C., Arias, R.: A new hybrid genetic algorithm for the job shop scheduling problem with setup times, pp. 116\u2013123, January 2008"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Kopetz, H., Ademaj, A., Grillinger, P., Steinhammer, K.: The time-triggered ethernet (TTE) design. In: Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2005), pp. 22\u201333, May 2005. \nhttps:\/\/doi.org\/10.1109\/ISORC.2005.56","DOI":"10.1109\/ISORC.2005.56"},{"issue":"23","key":"7_CR20","doi-asserted-by":"publisher","first-page":"4421","DOI":"10.1016\/j.ins.2008.07.031","volume":"178","author":"M Lozano","year":"2008","unstructured":"Lozano, M., Herrera, F., Cano, J.R.: Replacement strategies to preserve useful diversity in steady-state genetic algorithms. Inform. Sci. 178(23), 4421\u20134433 (2008). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025508002867\n\n. Including Special Section: Genetic and Evolutionary Computing","journal-title":"Inform. Sci."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Moghadam, A.M., Wong, K.Y., Piroozfard, H.: An efficient genetic algorithm for flexible job-shop scheduling problem. In: 2014 IEEE International Conference on Industrial Engineering and Engineering Management, pp. 1409\u20131413 (2014)","DOI":"10.1109\/IEEM.2014.7058870"},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T Murata","year":"1996","unstructured":"Murata, T., Ishibuchi, H., Tanaka, H.: Genetic algorithms for flowshop scheduling problems. Comput. Ind. Eng. 30(4), 1061\u20131071 (1996). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0360835296000538","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91\u201395 (1983). \nEconPapers.repec.org\/RePEc:eee:jomega:v:11:y:1983:i:1:p:91-95","journal-title":"Omega"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/3267419.3267421","volume":"15","author":"N Nayak","year":"2017","unstructured":"Nayak, N., D\u00fcrr, F., Rothermel, K.: Routing algorithms for IEEE802.1Qbv networks. ACM SIGBED Rev. 15, 13\u201318 (2017)","journal-title":"ACM SIGBED Rev."},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10845-012-0626-9","volume":"24","author":"L Nie","year":"2013","unstructured":"Nie, L., Gao, L., Li, P., Li, X.: A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. J. Intell. Manuf. 24(4), 763\u2013774 (2013). \nhttps:\/\/doi.org\/10.1007\/s10845-012-0626-9","journal-title":"J. Intell. Manuf."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Pahlevan, M., Obermaisser, R.: Genetic algorithm for scheduling time-triggered traffic in time-sensitive networks. In: 2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA), vol. 1, pp. 337\u2013344, September 2018","DOI":"10.1109\/ETFA.2018.8502515"},{"issue":"3","key":"7_CR27","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"JY Potvin","year":"1996","unstructured":"Potvin, J.Y.: Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63(3), 337\u2013370 (1996). \nhttps:\/\/doi.org\/10.1007\/BF02125403","journal-title":"Ann. Oper. Res."},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-58483-8_10","volume-title":"Evolutionary Computing","author":"CR Reeves","year":"1994","unstructured":"Reeves, C.R.: Genetic algorithms and neighbourhood search. In: Fogarty, T.C. (ed.) AISB EC 1994. LNCS, pp. 115\u2013130. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-58483-8_10"},{"issue":"1","key":"7_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1), 5\u201313 (1995). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0305054893E0014K\n\n. Genetic Algorithms","journal-title":"Comput. Oper. Res."},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34, 461\u2013476 (2006)","journal-title":"Omega"},{"key":"7_CR31","unstructured":"Syswerda, G.: Schedule optimization using genetic algorithms (1991)"},{"issue":"5","key":"7_CR32","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00170-010-2642-2","volume":"51","author":"X Wang","year":"2010","unstructured":"Wang, X., Gao, L., Zhang, C., Shao, X.: A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int. J. Adv. Manuf. Technol. 51(5), 757\u2013767 (2010). \nhttps:\/\/doi.org\/10.1007\/s00170-010-2642-2","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"7_CR33","first-page":"1","volume":"11","author":"F Werner","year":"2011","unstructured":"Werner, F.: Genetic algorithms for shop scheduling problems: a survey. Preprint Ser. 11, 1\u201366 (2011)","journal-title":"Preprint Ser."}],"container-title":["Lecture Notes in Computer Science","Measurement, Modelling and Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43024-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:04:23Z","timestamp":1583712263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43024-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030430238","9783030430245"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43024-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Measurement, Modelling and Evaluation of Computing Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saarbr\u00fccken","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mmb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.mmb2020.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.375","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}