{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:43:42Z","timestamp":1742993022559,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031302282"},{"type":"electronic","value":"9783031302299"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30229-9_23","type":"book-chapter","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T19:02:39Z","timestamp":1680980559000},"page":"351-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Frequency Fitness Assignment on\u00a0JSSP: A Critical Review"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0111-7078","authenticated-orcid":false,"given":"Ege","family":"de Bruin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6971-7817","authenticated-orcid":false,"given":"Sarah L.","family":"Thomson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5060-3342","authenticated-orcid":false,"given":"Daan van den","family":"Berg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Achary, T., Pillay, A., Jembere, E.J.: Towards rigorous foundations for metaheuristic research. In: IJCCI, pp. 151\u2013157 (2022)","DOI":"10.5220\/0011552600003332"},{"issue":"3","key":"23_CR2","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":"23_CR3","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."},{"issue":"1","key":"23_CR4","first-page":"B1","volume":"97","author":"T B\u00e4ck","year":"1997","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z.: Handb. Evol. Comput. Release 97(1), B1 (1997)","journal-title":"Handb. Evol. Comput. Release"},{"issue":"7391","key":"23_CR5","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1038\/483531a","volume":"483","author":"CG Begley","year":"2012","unstructured":"Begley, C.G., Ellis, L.M.: Raise standards for preclinical cancer research. Nature 483(7391), 531\u2013533 (2012)","journal-title":"Nature"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/B:JMMA.0000038614.39977.6f","volume":"3","author":"C Blum","year":"2004","unstructured":"Blum, C., Sampels, M.: An ant colony optimization algorithm for shop scheduling problems. J. Mathe. Model. Algorithms 3(3), 285\u2013308 (2004)","journal-title":"J. Mathe. Model. Algorithms"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Boese, K.D., Kahng, A.B.: Best-so-far vs. where-you-are: Implications for optimal finite-time annealing. Syst. Control lett. 22(1), 71\u201378 (1994)","DOI":"10.1016\/0167-6911(94)90028-0"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Braam, F., van den Berg, D.: Which rectangle sets have perfect packings? Oper. Res. Perspecti., p. 100211 (2022)","DOI":"10.1016\/j.orp.2021.100211"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Brouwer, N., Dijkzeul, D., Koppenhol, L., Pijning, I., Van den Berg, D.: Survivor selection in a crossoverless evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1631\u20131639 (2022)","DOI":"10.1145\/3520304.3533950"},{"key":"23_CR10","doi-asserted-by":"publisher","unstructured":"Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49(1-3), 107\u2013127 (Mar 1994). https:\/\/doi.org\/10.1016\/0166-218x(94)90204-6. https:\/\/doi.org\/10.1016\/0166-218x(94)90204-6","DOI":"10.1016\/0166-218x(94)90204-6"},{"key":"23_CR11","unstructured":"de Bruin, E.: Repostory containing source material for this study (2023). https:\/\/github.com\/egedebruin\/FFAProject"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-030-60376-2_10","volume-title":"Swarm Intelligence","author":"CL Camacho Villal\u00f3n","year":"2020","unstructured":"Camacho Villal\u00f3n, C.L., St\u00fctzle, T., Dorigo, M.: Grey wolf, firefly and bat algorithms: three widespread algorithms that do not contain any novelty. In: Dorigo, M., et al. (eds.) ANTS 2020. LNCS, vol. 12421, pp. 121\u2013133. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60376-2_10"},{"key":"23_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116029","volume":"189","author":"M Castelli","year":"2022","unstructured":"Castelli, M., Manzoni, L., Mariot, L., Nobile, M.S., Tangherloni, A.: Salp swarm optimization: a critical review. Expert Syst. Appl. 189, 116029 (2022)","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"23_CR14","first-page":"273","volume":"8","author":"S Chakraborty","year":"2015","unstructured":"Chakraborty, S., Bhowmik, S.: An efficient approach to job shop scheduling problem using simulated annealing. Int. J. Hybrid Inf. Technol. 8(11), 273\u2013284 (2015)","journal-title":"Int. J. Hybrid Inf. Technol."},{"key":"23_CR15","unstructured":"Cheeseman, P.C., Kanefsky, B., Taylor, W.M., et al.: Where the really hard problems are. In: IJCAI. vol. 91, pp. 331\u2013337 (1991)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: Complexity, algorithms and approximability. Handb. Comb. Optim., pp. 1493\u20131641 (1998)","DOI":"10.1007\/978-1-4613-0303-9_25"},{"issue":"8","key":"23_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/3360311","volume":"63","author":"A Cockburn","year":"2020","unstructured":"Cockburn, A., Dragicevic, P., Besan\u00e7on, L., Gutwin, C.: Threats of a replication crisis in empirical computer science. Commun. ACM 63(8), 70\u201379 (2020)","journal-title":"Commun. ACM"},{"key":"23_CR18","unstructured":"Dahmani, R., Boogmans, S., Meijs, A., Van den Berg, D.: Paintings-from-polygons: simulated annealing. In: International Conference on Computational Creativity (ICCC 2020) (2020)"},{"key":"23_CR19","unstructured":"De Jonge, M., Van den Berg, D.: Plant Propagation Parameterization: Offspring & Population Size, Evo* LBA\u2019s 2020, vol. 2, pp. 1\u20134. Springer (2020)"},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol, E., Mehta, S., Uzsoy, R.: Benchmarks for shop scheduling problems. Eur. J. Oper. Res. 109(1), 137\u2013141 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-031-03789-4_4","volume-title":"Artificial Intelligence in Music, Sound, Art and Design","author":"D Dijkzeul","year":"2022","unstructured":"Dijkzeul, D., Brouwer, N., Pijning, I., Koppenhol, L., van den Berg, D.: Painting with\u00a0Evolutionary Algorithms. In: Martins, T., Rodr\u00edguez-Fern\u00e1ndez, N., Rebelo, S.M. (eds.) EvoMUSART 2022. LNCS, vol. 13221, pp. 52\u201367. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-03789-4_4"},{"key":"23_CR22","unstructured":"Eiben, A.E., Smith, J.E., et al.: Introduction to evolutionary computing, vol. 53. Springer (2003) DOIurl10.1007\/978-3-662-05094-1"},{"key":"23_CR23","unstructured":"Fisher, H., Thompson, G.: Probabilistic learning combination of local job-shop scheduling rules, prentice-hall, englewood cliffs. Ind. Sched., pp. 225\u2013251 (1963)"},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathe. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Mathe. Oper. Res."},{"key":"23_CR25","unstructured":"Geleijn, R., van der Meer, M., van der Post, Q., van den Berg, D., et al.: The plant propagation algorithm on timetables: First results. EVO LBA\u2019s, p. 2 (2019)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Gromicho, J.A., van Hoorn, J.J., da Gama, F.S., Timmer, G.T.: Solving the job-shop scheduling problem optimally by dynamic programming. Comput. Oper. Res. 39(12), 2968\u20132977 (2012)","DOI":"10.1016\/j.cor.2012.02.024"},{"key":"23_CR27","first-page":"101","volume":"2018","author":"G van Horn","year":"2018","unstructured":"van Horn, G., Olij, R., Sleegers, J., van den Berg, D.: A predictive data analytic for the hardness of hamiltonian cycle problem instances. Data Analytics 2018, 101 (2018)","journal-title":"Data Analytics"},{"issue":"4","key":"23_CR28","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1016\/j.cor.2006.07.003","volume":"35","author":"KL Huang","year":"2008","unstructured":"Huang, K.L., Liao, C.J.: Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput. Oper. Res. 35(4), 1030\u20131046 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"23_CR29","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1109\/TEVC.2005.863127","volume":"10","author":"M Hutter","year":"2006","unstructured":"Hutter, M., Legg, S.: Fitness uniform optimization. IEEE Trans. Evol. Comput. 10(5), 568\u2013589 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"23_CR30","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"AS Jain","year":"1999","unstructured":"Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. Euro. J. Oper. Res. 113(2), 390\u2013434 (1999)","journal-title":"Euro. J. Oper. Res."},{"key":"23_CR31","doi-asserted-by":"publisher","unstructured":"de Jonge, M., van den Berg, D.: Parameter Sensitivity Patterns in the Plant Propagation Algorithm. No. April 2020, IJCCI 2020: Proceedings of the 12th International Joint Conference on Computational Intelligence (2020). https:\/\/doi.org\/10.5220\/0010134300920099","DOI":"10.5220\/0010134300920099"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Koppenhol, L., Brouwer, N., Dijkzeul, D., Pijning, I., Sleegers, J., Van Den Berg, D.: Exactly characterizable parameter settings in a crossoverless evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1640\u20131649 (2022)","DOI":"10.1145\/3520304.3533968"},{"key":"23_CR33","first-page":"445","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. Handb. Oper. Res. Manage. Sci. 4, 445\u2013522 (1993)","journal-title":"Handb. Oper. Res. Manage. Sci."},{"key":"23_CR34","volume-title":"Resouce constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement)","author":"S Lawrence","year":"1984","unstructured":"Lawrence, S.: Resouce constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement). Carnegie-Mellon University, Graduate School of Industrial Administration (1984)"},{"issue":"4","key":"23_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3466624","volume":"1","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2021","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Branke, J., Paquete, L.: Reproducibility in evolutionary computation. ACM Trans. Evol. Learn. Optimization 1(4), 1\u201321 (2021)","journal-title":"ACM Trans. Evol. Learn. Optimization"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Maxwell, S.E., Lau, M.Y., Howard, G.S.: Is psychology suffering from a replication crisis? what does failure to replicate really mean? American Psychologist 70(6), 487 (2015)","DOI":"10.1037\/a0039400"},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Niewenhuis, D., van den Berg, D.: Making hard(ER) bechmark test functions. In: IJCCI, pp. 29\u201338 (2022)","DOI":"10.5220\/0011405300003332"},{"key":"23_CR38","unstructured":"Silver, L.M.: An introduction to Fanny Sossisj\u2019 optimization algorithm. IIIE Transactions on Algorithmic Archaeology Iridescent Pegasus Publishers. Edinborough, Scotland 16(85), 1976\u20131993, (2023)"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"Sleegers, J., van den Berg, D.: Looking for the hardest hamiltonian cycle problem instances. In: IJCCI, pp. 40\u201348 (2020)","DOI":"10.5220\/0010066900400048"},{"key":"23_CR40","doi-asserted-by":"crossref","unstructured":"Sleegers, J., van den Berg, D.: The hardest hamiltonian cycle problem instances: the plateau of yes and the cliff of no. SCSC (2022)","DOI":"10.5220\/0011531900003332"},{"key":"23_CR41","volume":"7","author":"J Sleegers","year":"2020","unstructured":"Sleegers, J., Olij, R., van Horn, G., van den Berg, D.: Where the really hard problems aren\u2019t. Oper. Res. Perspect. 7, 100160 (2020)","journal-title":"Oper. Res. Perspect."},{"key":"23_CR42","doi-asserted-by":"crossref","unstructured":"Sleegers, J., Thomson, S.L., Van den Berg, D.: Making hard (ER) bechmark test functions, pp. 105\u2013111 (2022)","DOI":"10.5220\/0011531900003332"},{"key":"23_CR43","doi-asserted-by":"crossref","unstructured":"S\u00f6rensen, K., Arnold, F., Palhazi Cuervo, D.: A critical analysis of the improved clarke and wright savings algorithm. Int. Trans. Oper. Rese. 26(1), 54\u201363 (2019)","DOI":"10.1111\/itor.12443"},{"issue":"10","key":"23_CR44","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Manage. sci. 38(10), 1495\u20131509 (1992)","journal-title":"Manage. sci."},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Euro. J. Oper. Res. 64(2), 278\u2013285 (1993)","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"23_CR46","doi-asserted-by":"crossref","unstructured":"The Open Science Collaboration: Estimating the reproducibility of psychological science. Science 349(6251), aac4716 (2015)","DOI":"10.1126\/science.aac4716"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Van Den Berg, D., Adriaans, P.: Subset sum and the distribution of information. In: Proceedings of the 13th International Joint Conference on Computational Intelligence, pp. 135\u2013141 (2021)","DOI":"10.5220\/0010673200003063"},{"issue":"1","key":"23_CR48","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJ Van Laarhoven","year":"1992","unstructured":"Van Laarhoven, P.J., Aarts, E.H., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113\u2013125 (1992)","journal-title":"Oper. Res."},{"key":"23_CR49","doi-asserted-by":"crossref","unstructured":"Vrielink, W., van den Berg, D.: Fireworks algorithm versus plant propagation algorithm. In: IJCCI. pp. 101\u2013112 (2019)","DOI":"10.5220\/0008169401010112"},{"key":"23_CR50","unstructured":"Vrielink, W., Van den Berg, D.: A dynamic parameter for the plant propagation algorithm. Evo* LBA\u2019s pp. 5\u20139 (2021)"},{"key":"23_CR51","unstructured":"Vrielink, W., Van den Berg, D.: Parameter control for the Plant Propagation Algorithm Parameter control for the Plant Propagation Algorithm, pp. 1\u20134. No. March, Evo LBA\u2019s 2021, Springer (2021)"},{"key":"23_CR52","doi-asserted-by":"publisher","unstructured":"Weise, T., Li, X., Chen, Y., Wu, Z.: Solving job shop scheduling problems without using a bias for good solutions. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. ACM (Jul 2021). https:\/\/doi.org\/10.1145\/3449726.3463124. https:\/\/doi.org\/10.1145\/3449726.3463124","DOI":"10.1145\/3449726.3463124 10.1145\/3449726.3463124"},{"key":"23_CR53","unstructured":"Yamada, T., Nakano, R.: A genetic algorithm applicable to large-scale job-shop problems. In: PPSN. vol. 2, pp. 281\u2013290 (1992)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30229-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T23:03:30Z","timestamp":1729206210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30229-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031302282","9783031302299"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30229-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"78","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":"37","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":"14","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":"47% - 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","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}