{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:25:54Z","timestamp":1760027154745,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304867"},{"type":"electronic","value":"9783030304874"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30487-4_44","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T23:02:47Z","timestamp":1567983767000},"page":"567-584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Multi-objective Reinforcement Learning Algorithm for JSSP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9457-8422","authenticated-orcid":false,"given":"Beatriz M.","family":"M\u00e9ndez-Hern\u00e1ndez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9385-0781","authenticated-orcid":false,"given":"Erick D.","family":"Rodr\u00edguez-Bazan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1223-0589","authenticated-orcid":false,"given":"Yailen","family":"Martinez-Jimenez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3906-758X","authenticated-orcid":false,"given":"Pieter","family":"Libin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6346-4564","authenticated-orcid":false,"given":"Ann","family":"Now\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/11504894_71","volume-title":"Innovations in Applied Artificial Intelligence","author":"C Fayad","year":"2005","unstructured":"Fayad, C., Petrovic, S.: A fuzzy genetic algorithm for real-world job shop scheduling. In: Ali, M., Esposito, F. (eds.) IEA\/AIE 2005. LNCS (LNAI), vol. 3533, pp. 524\u2013533. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11504894_71"},{"issue":"2","key":"44_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M-R Garey","year":"1976","unstructured":"Garey, M.-R., Johnson, D.-S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Rameshkumar, K., Rajendran, C.: A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan. In: IOP Conference Series: Materials Science and Engineering, vol. 310, no. 1, p. 012143. IOP Publishing, February 2018","DOI":"10.1088\/1757-899X\/310\/1\/012143"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Zhao, F., Qin, S., Yang, G., Ma, W., Zhang, C., Song, H.: A differential-based harmony search algorithm with variable neighborhood search for job shop scheduling problem and its runtime analysis. IEEE Access (2018)","DOI":"10.1109\/ACCESS.2018.2877791"},{"key":"44_CR5","unstructured":"Urlings, T.: Heuristics and Metaheuristics for heavily constrained hybrid Flowshop problems. Ph.D. Universitat Politcnica de Valncia (2010)"},{"key":"44_CR6","unstructured":"Gabel, T., Riedmiller, M.: Adaptive reactive job-shop scheduling with reinforcement learning agents. Int. J. Inf. Technol. Intell. Comput. 24(4) (2008)"},{"issue":"4","key":"44_CR7","first-page":"487","volume":"5","author":"Y Cao","year":"2009","unstructured":"Cao, Y., Yang, Y., Wang, H., Yang, L.: Intelligent job shop scheduling based on MAS and integrated routing wasp algorithm and scheduling wasp algorithm. JSW 5(4), 487\u2013494 (2009)","journal-title":"JSW"},{"key":"44_CR8","unstructured":"Martinez Jimenez, Y.: A generic multi-agent reinforcement learning approach for scheduling problems. Ph.D., Vrije Universiteit Brussel, p. 128 (2012)"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.eswa.2018.01.027","volume":"99","author":"K Li","year":"2018","unstructured":"Li, K., Zhou, T., Liu, B.-H., Li, H.: A multi-agent system for sharing distributed manufacturing resources. Expert Syst. Appl. 99, 32\u201343 (2018)","journal-title":"Expert Syst. Appl."},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1613\/jair.3987","volume":"48","author":"D Roijers","year":"2013","unstructured":"Roijers, D., Vamplew, P., Whiteson, S., Dazeley, R.: A survey of multi-objective sequential decision-making. J. Artif. Intell. Res. 48, 67\u2013113 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"44_CR11","unstructured":"Rey Horn, J., Nafpliotis, N., Goldberg, D.-E.: A niched Pareto genetic algorithm for multiobjective optimization. In: Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, vol. 1, pp. 82\u201387. IEEE, June 1994"},{"issue":"4","key":"44_CR12","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.cie.2004.12.008","volume":"48","author":"M Watanabe","year":"2005","unstructured":"Watanabe, M., Ida, K., Gen, M.: A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Comput. Ind. Eng. 48(4), 743\u2013752 (2005)","journal-title":"Comput. Ind. Eng."},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","volume":"112","author":"R Zhang","year":"2016","unstructured":"Zhang, R., Chiong, R.: Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. J. Clean. Prod. 112, 3361\u20133375 (2016)","journal-title":"J. Clean. Prod."},{"key":"44_CR14","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/0-387-23667-8_7","volume-title":"Metaheuristic Optimization via Memory and Evolution","author":"E Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: Some new ideas in TS for job shop scheduling. In: Sharda, R., Vo\u00df, S., Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution. Operations Research\/Computer Science Interfaces Series, vol. 30, pp. 165\u2013190. Springer, Boston (2005)"},{"issue":"2","key":"44_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10845-008-0073-9","volume":"19","author":"G-R Weckman","year":"2008","unstructured":"Weckman, G.-R., Ganduri, C.-V., Koonce, D.-A.: A neural network job-shop scheduler. J. Intell. Manuf. 19(2), 191\u2013201 (2008)","journal-title":"J. Intell. Manuf."},{"issue":"2","key":"44_CR16","first-page":"68","volume":"5","author":"A Udomsakdigool","year":"2006","unstructured":"Udomsakdigool, A., Kachitvichyanukul, V.: Two-way scheduling approach in ant algorithm for solving job shop problems. Int. J. Ind. Eng. Manag. Syst. 5(2), 68\u201375 (2006)","journal-title":"Int. J. Ind. Eng. Manag. Syst."},{"issue":"15","key":"44_CR17","doi-asserted-by":"publisher","first-page":"4155","DOI":"10.1080\/00207540600990432","volume":"46","author":"A Udomsakdigool","year":"2008","unstructured":"Udomsakdigool, A., Kachitvichyanukul, V.: Multiple colony ant algorithm for job-shop scheduling problem. Int. J. Prod. Res. 46(15), 4155\u20134175 (2008)","journal-title":"Int. J. Prod. Res."},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Wong, L.-P., Puan, C.-Y., Low, M.-Y.-H., Chong, C.-S.: Bee colony optimization algorithm with big valley landscape exploitation for job shop scheduling problems. In: 40th Conference on Winter Simulation on Proceedings, pp. 2050\u20132058. Winter Simulation Conference (2008)","DOI":"10.1109\/WSC.2008.4736301"},{"key":"44_CR19","unstructured":"Surekha, P., Sumathi, S.: Solving fuzzy based job shop scheduling problems using GA and ACO. J. Emerg. Trends Comput. Inf. Sci. (2010)"},{"issue":"2","key":"44_CR20","first-page":"83","volume":"6","author":"T Pratchayaborirak","year":"2011","unstructured":"Pratchayaborirak, T., Kachitvichyanukul, V.: A two-stage PSO algorithm for job shop scheduling problem. Int. J. Manag. Sci. Eng. Manag. 6(2), 83\u201392 (2011)","journal-title":"Int. J. Manag. Sci. Eng. Manag."},{"issue":"4","key":"44_CR21","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1109\/TII.2014.2342378","volume":"10","author":"H Gao","year":"2014","unstructured":"Gao, H., Kwong, S., Fan, B., Wang, R.: A hybrid particle-swarm tabu search algorithm for solving job shop scheduling problems. IEEE Trans. Industr. Inf. 10(4), 2044\u20132054 (2014)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"44_CR22","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.cie.2015.04.006","volume":"85","author":"L Asadzadeh","year":"2015","unstructured":"Asadzadeh, L.: A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput. Ind. Eng. 85, 376\u2013383 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"44_CR23","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10845-009-0294-6","volume":"22","author":"V Kachitvichyanukul","year":"2011","unstructured":"Kachitvichyanukul, V., Sitthitham, S.: A two-stage genetic algorithm for multi-objective job shop scheduling problems. J. Intell. Manuf. 22(3), 355\u2013365 (2011)","journal-title":"J. Intell. Manuf."},{"key":"44_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cie.2017.02.019","volume":"107","author":"M Yazdani","year":"2017","unstructured":"Yazdani, M., Aleti, A., Khalili, S.-M., Jolai, F.: Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem. Comput. Ind. Eng. 107, 12\u201324 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"44_CR25","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s11277-018-5440-z","volume":"103","author":"Q Meng","year":"2018","unstructured":"Meng, Q., Zhang, L., Fan, Y.: Research on multi-objective job shop scheduling with dual particle swarm algorithm based on greedy strategy. Wireless Pers. Commun. 103(1), 255\u2013274 (2018)","journal-title":"Wireless Pers. Commun."},{"issue":"2","key":"44_CR26","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.eswa.2009.06.041","volume":"37","author":"D-Y Sha","year":"2010","unstructured":"Sha, D.-Y., Lin, H.-H.: A multi-objective PSO for job-shop scheduling problems. Expert Syst. Appl. 37(2), 1065\u20131070 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"8","key":"44_CR27","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1080\/09537280110040424","volume":"12","author":"SG Ponnambalam","year":"2001","unstructured":"Ponnambalam, S.G., Ramkumar, V., Jawahar, N.: A multiobjective genetic algorithm for job shop scheduling. Prod. Planning Control 12(8), 764\u2013774 (2001)","journal-title":"Prod. Planning Control"},{"key":"44_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.cie.2017.07.021","volume":"111","author":"M Kurdi","year":"2017","unstructured":"Kurdi, M.: An improved island model memetic algorithm with a new cooperation phase for multi-objective job shop scheduling problem. Comput. Ind. Eng. 111, 183\u2013201 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"44_CR29","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.-A.-M.-T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"44_CR30","doi-asserted-by":"crossref","unstructured":"Wang, B., Xie, H., Xia, X., Zhang, X.-X.: A NSGA-II algorithm hybridizing local simulated-annealing operators for a bicriteria robust job-shop scheduling problem under scenarios. IEEE Trans. Fuzzy Syst. (2018)","DOI":"10.1109\/TFUZZ.2018.2879789"},{"issue":"1\u20132","key":"44_CR31","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/s00170-004-2492-x","volume":"29","author":"RK Suresh","year":"2006","unstructured":"Suresh, R.K., Mohanasundaram, K.M.: Pareto archived simulated annealing for job shop scheduling with multiple objectives. The Int. J. Adv. Manuf. Technol. 29(1\u20132), 184\u2013196 (2006)","journal-title":"The Int. J. Adv. Manuf. Technol."},{"issue":"10","key":"44_CR32","doi-asserted-by":"publisher","first-page":"2431","DOI":"10.1016\/j.engappai.2013.07.011","volume":"26","author":"S-H Niu","year":"2013","unstructured":"Niu, S.-H., Ong, S.-K., Nee, A.-Y.: An improved intelligent water drops algorithm for solving multi-objective job shop scheduling. Eng. Appl. Artif. Intell. 26(10), 2431\u20132442 (2013)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"44_CR33","first-page":"151","volume":"12","author":"W Wisittipanich","year":"2013","unstructured":"Wisittipanich, W., Kachitvichyanukul, V.: An efficient PSO algorithm for finding Pareto-frontier in multi-objective job shop scheduling problems. Ind. Eng. Manag. Syst. 12(2), 151\u2013160 (2013)","journal-title":"Ind. Eng. Manag. Syst."},{"issue":"4","key":"44_CR34","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1\u20132","key":"44_CR35","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s00170-005-0029-6","volume":"30","author":"D Lei","year":"2006","unstructured":"Lei, D., Wu, Z.: Crowding-measure-based multiobjective evolutionary algorithm for job shop scheduling. Int. J. Adv. Manuf. Technol. 30(1\u20132), 112\u2013117 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"44_CR36","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cie.2007.11.007","volume":"54","author":"D Lei","year":"2008","unstructured":"Lei, D.: A Pareto archive particle swarm optimization for multi-objective job shop scheduling. Comput. Ind. Eng. 54(4), 960\u2013971 (2008)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"44_CR37","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10845-014-1026-0","volume":"28","author":"X Hao","year":"2017","unstructured":"Hao, X., Gen, M., Lin, L., Suer, G.-A.: Effective multiobjective EDA for bi-criteria stochastic job-shop scheduling problem. J. Intell. Manuf. 28(3), 833\u2013845 (2017)","journal-title":"J. Intell. Manuf."},{"issue":"3\u20134","key":"44_CR38","first-page":"279","volume":"8","author":"C-J Watkins","year":"1992","unstructured":"Watkins, C.-J., Dayan, P.: Q-learning. Mach. Learn. 8(3\u20134), 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"key":"44_CR39","volume-title":"Introduction to Reinforcement Learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Introduction to Reinforcement Learning, vol. 135. MIT Press, Cambridge (1998)"},{"key":"44_CR40","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-16111-7_23","volume-title":"KI 2010: Advances in Artificial Intelligence","author":"M Tokic","year":"2010","unstructured":"Tokic, M.: Adaptive $$\\epsilon $$ -Greedy exploration in reinforcement learning based on value differences. In: Dillmann, R., Beyerer, J., Hanebeck, U.D., Schultz, T. (eds.) KI 2010. LNCS (LNAI), vol. 6359, pp. 203\u2013210. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16111-7_23"},{"issue":"1","key":"44_CR41","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1257\/jep.9.1.51","volume":"9","author":"P Young","year":"1995","unstructured":"Young, P.: Optimal voting rules. J. Econ. Perspect. 9(1), 52\u201364 (1995)","journal-title":"J. Econ. Perspect."},{"key":"44_CR42","doi-asserted-by":"crossref","unstructured":"Cheng, H.C., Chiang, T.C., Fu, L.C.: Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure. In: Computational Intelligence in Scheduling, CI-Sched 2009, pp. 15\u201321. IEEE, April 2009","DOI":"10.1109\/SCIS.2009.4927009"},{"issue":"2","key":"44_CR43","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0377-2217(03)00020-1","volume":"156","author":"S Opricovic","year":"2004","unstructured":"Opricovic, S., Tzeng, G.-H.: Compromise solution by MCDM methods: a comparative analysis of VIKOR and TOPSIS. Eur. J. Oper. Res. 156(2), 445\u2013455 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"44_CR44","unstructured":"Beasley, J.-E.: OR-Library (2014). http:\/\/people.brunel.ac.uk\/mastjjb\/jeb\/info.html"},{"key":"44_CR45","unstructured":"Fisher, H.: Probabilistic learning combinations of local job shop scheduling rules. Ind. Sched., 225\u2013251 (1963)"},{"issue":"3","key":"44_CR46","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34(3), 391\u2013401 (1988)","journal-title":"Manage. Sci."},{"issue":"2","key":"44_CR47","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2), 149\u2013156 (1991)","journal-title":"ORSA J. Comput."},{"key":"44_CR48","unstructured":"Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Graduate School of Industrial Administration, Carnegie-Mellon University (1984)"},{"key":"44_CR49","unstructured":"Ruiz-Vanoye, J.A., Diaz-Parra, O., Perez-Ortega, J., Salgado, G.R., Gonzalez-Barbosa, J.J.: Complexity of instances for combinatorial optimization problems. In Computational Intelligence and Modern Heuristics, IntechOpen (2010)"},{"key":"44_CR50","doi-asserted-by":"crossref","unstructured":"Yamada, T., Nakano, R.: Genetic algorithms for job-shop scheduling problems. In: Proceedings of Modern Heuristic for Decision Support, pp. 67\u201381 (1997)","DOI":"10.1049\/PBCE055E_ch7"},{"key":"44_CR51","doi-asserted-by":"crossref","unstructured":"Riquelme, N., Von L\u00fccken, C., Baran, B.: Performance metrics in multi-objective optimization. In: Computing Conference (CLEI), Latin American, pp. 1\u201311. IEEE (2015)","DOI":"10.1109\/CLEI.2015.7360024"},{"key":"44_CR52","volume-title":"Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications, vol. 63. Shaker, Ithaca (1999)"},{"issue":"3","key":"44_CR53","first-page":"185","volume":"16","author":"J-N Tsitsiklis","year":"1994","unstructured":"Tsitsiklis, J.-N.: Asynchronous stochastic approximation and Q-learning. Mach. Learn. 16(3), 185\u2013202 (1994)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2019: Theoretical Neural Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30487-4_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T21:34:42Z","timestamp":1664314482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30487-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304867","9783030304874"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30487-4_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icann2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-nns.org\/icann2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}