{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:58:27Z","timestamp":1755799107843,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030944780"},{"type":"electronic","value":"9783030944797"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94479-7_11","type":"book-chapter","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T09:02:57Z","timestamp":1641546177000},"page":"165-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Decomposition-Based Job-Shop Scheduling with\u00a0Constrained Clustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1088-2081","authenticated-orcid":false,"given":"Mohammed M. S.","family":"El-Kholany","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0286-0958","authenticated-orcid":false,"given":"Konstantin","family":"Schekotihin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8010-4752","authenticated-orcid":false,"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,7]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2016-1396","volume":"147","author":"M Abseher","year":"2016","unstructured":"Abseher, M., Gebser, M., Musliu, N., Schaub, T., Woltran, S.: Shift design with answer set programming. Fundam. Inform. 147(1), 1\u201325 (2016)","journal-title":"Fundam. Inform."},{"issue":"9\u201312","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.1007\/s00170-013-5354-6","volume":"70","author":"M Adibi","year":"2014","unstructured":"Adibi, M., Shahrabi, J.: A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem. Int. J. Adv. Manuf. Technol. 70(9\u201312), 1955\u20131961 (2014)","journal-title":"Int. J. Adv. Manuf. Technol."},{"unstructured":"Al-Ashhab, M., Munshi, S., Oreijah, M., Ghulman, H.: Job shop scheduling using mixed integer programming. Int. J. Mod. Eng. Res. 7(3), 2:23\u20132:29 (2017)","key":"11_CR3"},{"unstructured":"Baker, K.: Introduction to Sequencing and Scheduling. John Wiley & Sons, New York (1974)","key":"11_CR4"},{"doi-asserted-by":"publisher","unstructured":"Balduccini, M.: Industrial-size scheduling with ASP+CP. In: Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201911), pp. 284\u2013296. Springer-Verlag (2011). https:\/\/doi.org\/10.1007\/978-3-642-20895-9","key":"11_CR5","DOI":"10.1007\/978-3-642-20895-9"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","volume":"275","author":"M Banbara","year":"2019","unstructured":"Banbara, M., Inoue, K., Kaufmann, B., Okimoto, T., Schaub, T., Soh, T., Tamura, N., Wanko, P.: teaspoon: solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1), 3\u201337 (2019)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"J Blackstone","year":"1982","unstructured":"Blackstone, J., Phillips, D., Hogg, G.: A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int. J. Prod. Res. 20(1), 27\u201345 (1982)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","volume":"26","author":"B \u00c7alis","year":"2015","unstructured":"\u00c7alis, B., Bulkan, S.: A research survey: review of AI solution strategies of job shop scheduling problem. J. Intell. Manuf. 26(5), 961\u2013973 (2015)","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"I Chaudhry","year":"2016","unstructured":"Chaudhry, I., Khan, A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-30048-7_9","volume-title":"Principles and Practice of Constraint Programming","author":"G Da Col","year":"2019","unstructured":"Da Col, G., Teppan, E.C.: Industrial size job shop scheduling tackled by present day CP solvers. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 144\u2013160. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_9"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/s10729-017-9428-0","volume":"22","author":"M Demirbilek","year":"2019","unstructured":"Demirbilek, M., Branke, J., Strauss, A.: Dynamically accepting and scheduling patients for home healthcare. Health Care Manag. Sci. 22(1), 140\u2013155 (2019)","journal-title":"Health Care Manag. Sci."},{"issue":"1","key":"11_CR13","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."},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/s00453-019-00616-2","volume":"82","author":"H Ding","year":"2020","unstructured":"Ding, H., Xu, J.: A unified framework for clustering constrained data without locality property. Algorithmica 82(4), 808\u2013852 (2020)","journal-title":"Algorithmica"},{"doi-asserted-by":"publisher","unstructured":"Dodaro, C., Galat\u00e0, G., Grioni, A., Maratea, M., Mochi, M., Porro, I.: An ASP-based solution to the chemotherapy treatment scheduling problem. Theory Pract. Logic Program. First View 1\u201317 (2021). https:\/\/doi.org\/10.1017\/S1471068421000363","key":"11_CR15","DOI":"10.1017\/S1471068421000363"},{"unstructured":"El-Kholany, M., Gebser, M.: Job shop scheduling with multi-shot ASP. In: Proceedings of the Fourth Workshop on Trends and Applications of Answer Set Programming (TAASP2020) (2020). http:\/\/www.kr.tuwien.ac.at\/events\/taasp20\/papers\/TAASP_2020_paper_4.pdf","key":"11_CR16"},{"key":"11_CR17","first-page":"768","volume":"21","author":"E Forgy","year":"1965","unstructured":"Forgy, E.: Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21, 768\u2013769 (1965)","journal-title":"Biometrics"},{"doi-asserted-by":"crossref","unstructured":"Francescutto, G., Schekotihin, K., El-Kholany, M.: Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP. In: Proceedings of the Seventeenth European Conference on Logics in Artificial Intelligence (JELIA 2021), pp. 313\u2013328. Springer-Verlag (2021)","key":"11_CR18","DOI":"10.1007\/978-3-030-75775-5_21"},{"unstructured":"French, S.: Sequencing and Scheduling: An Introduction to the Mathematics of the Job-shop. John Wiley & Sons, New York (1982)","key":"11_CR19"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Sethi, R.: The complexity of Flowshop and Jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Logic Program. 19(1), 27\u201382 (2019)","journal-title":"Theory Pract. Logic Program."},{"unstructured":"Harrath, Y., Chebel-Morello, B., Zerhouni, N.: A genetic algorithm and data mining based meta-heuristic for job shop scheduling problem. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC 2002). IEEE (2002)","key":"11_CR22"},{"unstructured":"Ismail, R., Othman, Z., Bakar, A.: A production schedule generator framework for pattern sequential mining. In: Proceedings of the Seventh International Conference on Computing and Convergence Technology (ICCCT 2012), pp. 784\u2013788. IEEE (2012)","key":"11_CR23"},{"doi-asserted-by":"publisher","unstructured":"Janakbhai, N., Saurin, M., Patel, M.: Blockchain-based intelligent transportation system with priority scheduling. In: Data Science and Intelligent Applications, pp. 311\u2013317. Springer-Verlag, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-15-4474-3","key":"11_CR24","DOI":"10.1007\/978-981-15-4474-3"},{"doi-asserted-by":"crossref","unstructured":"Jones, A., Rabelo, L., Sharawi, A.: Survey of job shop scheduling techniques. National Institute of Standards and Technology Encyclopedia of Electrical and Electronics Engineering (1998). https:\/\/tsapps.nist.gov\/publication\/get_pdf.cfm?pub_id=821200","key":"11_CR25","DOI":"10.1002\/047134608X.W3352"},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0360-8352(00)00050-4","volume":"38","author":"D Koonce","year":"2000","unstructured":"Koonce, D., Tsai, S.: Using data mining to find patterns in genetic algorithm solutions to a job shop schedule. Comput. Ind. Eng. 38(3), 361\u2013374 (2000)","journal-title":"Comput. Ind. Eng."},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"J Lenstra","year":"1979","unstructured":"Lenstra, J., Rinnooy Kan, A.: Computational complexity of discrete optimization problems. Ann. Discrete Math. 4, 121\u2013140 (1979)","journal-title":"Ann. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Meng, L., Zhang, C., Ren, Y., Zhang, B., Lv, C.: Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput. Ind. Eng. 142, Article 106347 (2020)","key":"11_CR28","DOI":"10.1016\/j.cie.2020.106347"},{"issue":"21","key":"11_CR29","doi-asserted-by":"publisher","first-page":"11107","DOI":"10.1007\/s00500-018-3663-2","volume":"23","author":"M Nasiri","year":"2019","unstructured":"Nasiri, M., Salesi, S., Rahbari, A., Meydani, N., Abdollai, M.: A data mining approach for population-based methods to solve the JSSP. Soft Comput. 23(21), 11107\u201311122 (2019)","journal-title":"Soft Comput."},{"issue":"3","key":"11_CR30","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","volume":"29","author":"M Nouiri","year":"2018","unstructured":"Nouiri, M., Bekrar, A., Jemai, A., Niar, S., Ammari, A.: An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. J. Intell. Manuf. 29(3), 603\u2013615 (2018)","journal-title":"J. Intell. Manuf."},{"doi-asserted-by":"publisher","unstructured":"Ovacik, I., Uzsoy, R.: Decomposition Methods for Complex Factory Scheduling Problems. Kluwer Academic Publishers, Boston (1997). https:\/\/doi.org\/10.1007\/978-1-4615-6329-7","key":"11_CR31","DOI":"10.1007\/978-1-4615-6329-7"},{"issue":"10","key":"11_CR32","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10), 3202\u20133212 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"11_CR33","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S147106841100007X","volume":"12","author":"F Ricca","year":"2012","unstructured":"Ricca, F., et al.: Team-building with answer set programming in the Gioia-Tauro seaport. Theory Pract. Logic Program. 12(3), 361\u2013381 (2012)","journal-title":"Theory Pract. Logic Program."},{"issue":"1","key":"11_CR34","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ejor.2019.10.047","volume":"283","author":"J Schoenfelder","year":"2020","unstructured":"Schoenfelder, J., Bretthauer, K., Wright, D., Coe, E.: Nurse scheduling with quick-response methods: Improving hospital performance, nurse workload, and patient experience. Eur. J. Oper. Res. 283(1), 390\u2013403 (2020)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Shahzad, A., Mebarki, N.: Discovering dispatching rules for job shop scheduling problem through data mining. In: Proceedings of the Eighth International Conference of Modeling and Simulation (MOSIM 2010) (2010). https:\/\/www.academia.edu\/3068769\/DISCOVERING_DISPATCHING_RULES_FOR_JOB_SHOP_SCHEDULING_PROBLEM_THROUGH_DATA_MINING","key":"11_CR35"},{"issue":"3","key":"11_CR36","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0305-0548(99)00098-2","volume":"28","author":"M Singer","year":"2001","unstructured":"Singer, M.: Decomposition methods for large job shops. Comput. Oper. Res. 28(3), 193\u2013207 (2001)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"11_CR37","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-218X(95)80004-N","volume":"59","author":"Y Sotskov","year":"1995","unstructured":"Sotskov, Y., Shakhlevich, N.: NP-hardness of shop-scheduling problems with three jobs. Discrete Appl. Math. 59(3), 237\u2013266 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"11_CR38","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Tassel, P., Gebser, M., Schekotihin, K.: A reinforcement learning environment for job-shop scheduling. In: Proceedings of the ICAPS 2021 Workshop on Planning and Reinforcement Learning (PRL 2021) (2021). https:\/\/prl-theworkshop.github.io\/prl2021\/papers\/PRL2021_paper_9.pdf","key":"11_CR39"},{"issue":"6","key":"11_CR40","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1080\/002075400188843","volume":"38","author":"R Uzsoy","year":"2000","unstructured":"Uzsoy, R., Wang, C.: Performance of decomposition procedures for job shop scheduling problems with bottleneck machines. Int. J. Prod. Res. 38(6), 1271\u20131286 (2000)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"11_CR41","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","volume":"8","author":"R Vaessens","year":"1996","unstructured":"Vaessens, R., Aarts, E., Lenstra, J.: Job shop scheduling by local search. INFORMS J. Comput. 8(3), 302\u2013317 (1996)","journal-title":"INFORMS J. Comput."},{"unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schr\u00f6dl, S.: Constrained k-means clustering with background knowledge. In: Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), pp. 577\u2013584. Morgan Kaufmann, San Francisco (2001)","key":"11_CR42"},{"issue":"1","key":"11_CR43","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1287\/trsc.2017.0753","volume":"53","author":"H Wang","year":"2019","unstructured":"Wang, H.: Routing and scheduling for a last-mile transportation system. Transp. Sci. 53(1), 131\u2013147 (2019)","journal-title":"Transp. Sci."},{"issue":"5","key":"11_CR44","first-page":"1397","volume":"7","author":"Y Zhai","year":"2014","unstructured":"Zhai, Y., Liu, C., Chu, W., Guo, R., Liu, C.: A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems. J. Ind. Eng. Manag. 7(5), 1397\u20131414 (2014)","journal-title":"J. Ind. Eng. Manag."},{"key":"11_CR45","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-46150-8_4","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Basu, S., Davidson, I.: A framework for deep constrained clustering - algorithms and advances. In: Brefeld, U., et al. (eds.) ECML PKDD 2019. LNCS (LNAI), vol. 11906, pp. 57\u201372. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-46150-8_4"},{"issue":"1","key":"11_CR46","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10489-008-0134-y","volume":"32","author":"R Zhang","year":"2010","unstructured":"Zhang, R., Wu, C.: A hybrid approach to large-scale job shop scheduling. Appl. Intell. 32(1), 47\u201359 (2010)","journal-title":"Appl. Intell."}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94479-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T17:06:05Z","timestamp":1650560765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94479-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030944780","9783030944797"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94479-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Philadelphia, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl22.sigplan.org\/home\/PADL-2022","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":"22","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":"9","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":"4","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":"41% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}