{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T02:54:25Z","timestamp":1781319265603,"version":"3.54.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031436185","type":"print"},{"value":"9783031436192","type":"electronic"}],"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-43619-2_17","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"243-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid ASP-Based Multi-objective Scheduling of\u00a0Semiconductor Manufacturing Processes"],"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":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4794-6560","authenticated-orcid":false,"given":"Ramsha","family":"Ali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8010-4752","authenticated-orcid":false,"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1017\/S1471068420000046","volume":"21","author":"D Abels","year":"2021","unstructured":"Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., Wanko, P.: Train scheduling with hybrid ASP. Theory Pract. Logic Program. 21(3), 317\u2013347 (2021). https:\/\/doi.org\/10.1017\/S1471068420000046","journal-title":"Theory Pract. Logic Program."},{"issue":"1","key":"17_CR2","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. Fund. Inform. 147(1), 1\u201325 (2016). https:\/\/doi.org\/10.3233\/FI-2016-1396","journal-title":"Fund. Inform."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-031-24841-2_6","volume-title":"Practical Aspects of Declarative Languages","author":"R Ali","year":"2023","unstructured":"Ali, R., El-Kholany, M., Gebser, M.: Flexible job-shop scheduling for semiconductor manufacturing with hybrid answer set programming (application paper). In: Hanus, M., Inclezan, D. (eds.) PADL. LNCS, vol. 13880, pp. 85\u201395. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-24841-2_6"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Ali, R., El-Kholany, M., Gebser, M.: Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (extended version) (2023). https:\/\/doi.org\/10.48550\/arXiv.2307.14799","DOI":"10.48550\/arXiv.2307.14799"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-20895-9_33","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Balduccini","year":"2011","unstructured":"Balduccini, M.: Industrial-size scheduling with ASP+CP. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 284\u2013296. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20895-9_33"},{"issue":"1","key":"17_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., et al.: teaspoon: Solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1), 3\u201337 (2019). https:\/\/doi.org\/10.1007\/s10479-018-2757-7","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369\u2013375 (1990). https:\/\/doi.org\/10.1007\/BF02238804","journal-title":"Computing"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s12351-020-00615-0","volume":"21","author":"Z Ceylan","year":"2021","unstructured":"Ceylan, Z., Tozan, H., Bulkan, S.: A coordinated scheduling problem for the supply chain in a flexible job shop machine environment. Oper. Res. Int. Journal 21(2), 875\u2013900 (2021). https:\/\/doi.org\/10.1007\/s12351-020-00615-0","journal-title":"Oper. Res. Int. Journal"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11814948_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"S Cotton","year":"2006","unstructured":"Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 170\u2013183. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_19"},{"key":"17_CR10","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":"6","key":"17_CR11","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1017\/S1471068421000363","volume":"21","author":"C Dodaro","year":"2021","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. 21(6), 835\u2013851 (2021). https:\/\/doi.org\/10.1017\/S1471068421000363","journal-title":"Theory Pract. Logic Program."},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Eiter, T., Geibinger, T., Musliu, N., Oetsch, J., Skocovsk\u00fd, P., Stepanova, D.: Answer-set programming for lexicographical makespan optimisation in parallel machine scheduling. In: Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), pp. 280\u2013290. AAAI Press (2021). https:\/\/doi.org\/10.24963\/kr.2021\/27","DOI":"10.24963\/kr.2021\/27"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1017\/S1471068422000217","volume":"22","author":"M El-Kholany","year":"2022","unstructured":"El-Kholany, M., Gebser, M., Schekotihin, K.: Problem decomposition and multi-shot ASP solving for job-shop scheduling. Theory Pract. Logic Program. 22(4), 623\u2013639 (2022). https:\/\/doi.org\/10.1017\/S1471068422000217","journal-title":"Theory Pract. Logic Program."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-030-75775-5_21","volume-title":"Logics in Artificial Intelligence","author":"G Francescutto","year":"2021","unstructured":"Francescutto, G., Schekotihin, K., El-Kholany, M.M.S.: Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds.) JELIA 2021. LNCS (LNAI), vol. 12678, pp. 313\u2013328. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75775-5_21"},{"issue":"2","key":"17_CR15","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). https:\/\/doi.org\/10.1287\/moor.1.2.117","journal-title":"Math. Oper. Res."},{"issue":"1","key":"17_CR16","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). https:\/\/doi.org\/10.1017\/S1471068418000054","journal-title":"Theory Pract. Logic Program."},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Technical Communications of the Thirty-second International Conference on Logic Programming (ICLP 2016), pp. 2:1\u20132:15. Schloss Dagstuhl (2016). https:\/\/doi.org\/10.4230\/OASIcs.ICLP.2016.2","DOI":"10.4230\/OASIcs.ICLP.2016.2"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Gran, S., Ismail, I., Ajol, T., Ibrahim, A.: Mixed integer programming model for flexible job-shop scheduling problem (FJSP) to minimize makespan and total machining time. In: Proceedings of the International Conference on Computer, Communications, and Control Technology (I4CT), pp. 413\u2013417. IEEE (2015). https:\/\/doi.org\/10.1109\/I4CT.2015.7219609","DOI":"10.1109\/I4CT.2015.7219609"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Ham, A., Park, M., Kim, K.: Energy-aware flexible job shop scheduling using mixed integer programming and constraint programming. Math. Probl. Eng. 2021(Article ID 8035806), 1\u201312 (2021). https:\/\/doi.org\/10.1155\/2021\/8035806","DOI":"10.1155\/2021\/8035806"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.asoc.2016.08.019","volume":"49","author":"A Hassanzadeh","year":"2016","unstructured":"Hassanzadeh, A., Rasti-Barzoki, M., Khosroshahi, H.: Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment. Appl. Soft Comput. 49, 335\u2013351 (2016). https:\/\/doi.org\/10.1016\/j.asoc.2016.08.019","journal-title":"Appl. Soft Comput."},{"issue":"5\u20136","key":"17_CR21","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1017\/S1471068417000242","volume":"17","author":"T Janhunen","year":"2017","unstructured":"Janhunen, T., Kaminski, R., Ostrowski, M., Schellhorn, S., Wanko, P., Schaub, T.: Clingo goes linear constraints over reals and integers. Theory Pract. Logic Program. 17(5\u20136), 872\u2013888 (2017). https:\/\/doi.org\/10.1017\/S1471068417000242","journal-title":"Theory Pract. Logic Program."},{"issue":"4","key":"17_CR22","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/TSM.2020.3001933","volume":"33","author":"D Kopp","year":"2020","unstructured":"Kopp, D., Hassoun, M., Kalir, A., M\u00f6nch, L.: SMT2020-A semiconductor manufacturing testbed. IEEE Trans. Semicond. Manuf. 33(4), 522\u2013531 (2020). https:\/\/doi.org\/10.1109\/TSM.2020.3001933","journal-title":"IEEE Trans. Semicond. Manuf."},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs, B., Tassel, P., Ali, R., El-Kholany, M., Gebser, M., Seidel, G.: A customizable simulator for artificial intelligence research to schedule semiconductor fabs. In: Proceedings of the Thirty-third Annual SEMI Advanced Semiconductor Manufacturing Conference (ASMC 2022), pp. 106\u2013111. IEEE (2022). https:\/\/doi.org\/10.1109\/ASMC54647.2022.9792520","DOI":"10.1109\/ASMC54647.2022.9792520"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.eng.2021.12.006","volume":"9","author":"M Leslie","year":"2022","unstructured":"Leslie, M.: Pandemic scrambles the semiconductor supply chain. Engineering 9, 10\u201312 (2022). https:\/\/doi.org\/10.1016\/j.eng.2021.12.006","journal-title":"Engineering"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li, X., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93\u2013110 (2016). https:\/\/doi.org\/10.1016\/j.ijpe.2016.01.016","journal-title":"Int. J. Prod. Econ."},{"key":"17_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24658-7","volume-title":"Answer Set Programming","author":"V Lifschitz","year":"2019","unstructured":"Lifschitz, V.: Answer Set Programming. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24658-7"},{"issue":"6","key":"17_CR27","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L M\u00f6nch","year":"2011","unstructured":"M\u00f6nch, L., Fowler, J., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mason, S., Rose, O.: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. J. Sched. 14(6), 583\u2013599 (2011). https:\/\/doi.org\/10.1007\/s10951-010-0222-9","journal-title":"J. Sched."},{"issue":"1","key":"17_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10951-007-0049-1","volume":"11","author":"M Pfund","year":"2008","unstructured":"Pfund, M., Balasubramanian, H., Fowler, J., Mason, S., Rose, O.: A multi-criteria approach for scheduling semiconductor wafer fabrication facilities. J. Sched. 11(1), 29\u201347 (2008). https:\/\/doi.org\/10.1007\/s10951-007-0049-1","journal-title":"J. Sched."},{"key":"17_CR29","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/0-387-33117-4_9","volume-title":"Handbook of Production Scheduling","author":"M Pfund","year":"2006","unstructured":"Pfund, M., Mason, S., Fowler, J.: Semiconductor manufacturing scheduling and dispatching. In: Herrmann, J.W. (ed.) Handbook of Production Scheduling. International Series in Operations Research and Management Science, vol. 89, pp. 213\u2013241. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/0-387-33117-4_9"},{"issue":"3","key":"17_CR30","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). https:\/\/doi.org\/10.1017\/S147106841100007X","journal-title":"Theory Pract. Logic Program."},{"key":"17_CR31","unstructured":"Sahraeian, R., Rohaninejad, M., Fadavi, M.: A new model for integrated lot sizing and scheduling in flexible job shop problem. J. Ind. Syst. Eng. 10(3), 72\u201391 (2017). https:\/\/www.jise.ir\/article_44919.html"},{"issue":"2","key":"17_CR32","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). https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-75775-5_30","volume-title":"Logics in Artificial Intelligence","author":"P Tassel","year":"2021","unstructured":"Tassel, P., Rbaia, M.: A multi-shot ASP encoding for the aircraft routing and maintenance planning problem. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds.) JELIA 2021. LNCS (LNAI), vol. 12678, pp. 442\u2013457. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75775-5_30"},{"issue":"2","key":"17_CR34","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/TSM.2006.873510","volume":"19","author":"A Upasani","year":"2006","unstructured":"Upasani, A., Uzsoy, R., Sourirajan, K.: A problem reduction approach for scheduling semiconductor wafer fabrication facilities. IEEE Trans. Semicond. Manuf. 19(2), 216\u2013225 (2006). https:\/\/doi.org\/10.1109\/TSM.2006.873510","journal-title":"IEEE Trans. Semicond. Manuf."},{"issue":"6","key":"17_CR35","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L Wang","year":"2001","unstructured":"Wang, L., Zheng, D.: An effective hybrid optimization strategy for job-shop scheduling problems. Comput. Oper. Res. 28(6), 585\u2013596 (2001). https:\/\/doi.org\/10.1016\/S0305-0548(99)00137-9","journal-title":"Comput. Oper. Res."},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Waschneck, B., et al.: Deep reinforcement learning for semiconductor production scheduling. In: Proceedings of the Twenty-ninth Annual SEMI Advanced Semiconductor Manufacturing Conference (ASMC 2018), pp. 301\u2013306. IEEE (2018). https:\/\/doi.org\/10.1109\/ASMC.2018.8373191","DOI":"10.1109\/ASMC.2018.8373191"},{"issue":"3","key":"17_CR37","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"L Xing","year":"2010","unstructured":"Xing, L., Chen, Y., Wang, P., Zhao, Q., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888\u2013896 (2010). https:\/\/doi.org\/10.1016\/j.asoc.2009.10.006","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43619-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:06:16Z","timestamp":1695481576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","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":"111","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":"41","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":"11","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":"37% - 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,6","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)"}}]}}