{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:11:17Z","timestamp":1774966277143,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T00:00:00Z","timestamp":1683158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T00:00:00Z","timestamp":1683158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100012774","name":"Innovationsfonden","doi-asserted-by":"publisher","award":["8053-00023B"],"award-info":[{"award-number":["8053-00023B"]}],"id":[{"id":"10.13039\/100012774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10951-023-00778-6","type":"journal-article","created":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T17:01:55Z","timestamp":1683219715000},"page":"353-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Exact and metaheuristic methods for a real-world examination timetabling problem"],"prefix":"10.1007","volume":"26","author":[{"given":"Mats","family":"Carlsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Ceschia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3416-7349","authenticated-orcid":false,"given":"Rasmus \u00d8rnstrup","family":"Mikkelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas Jacob Riis","family":"Stidsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,4]]},"reference":[{"key":"778_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cie.2018.11.037","volume":"127","author":"O Abou Kasm","year":"2019","unstructured":"Abou Kasm, O., Mohandes, B., Diabat, A., & El Khatib, S. (2019). Exam timetabling with allowable conflicts within a time window. Computers & Industrial Engineering, 127, 263\u2013273.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"778_CR2","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1111\/itor.12471","volume":"27","author":"F Al-Hawari","year":"2020","unstructured":"Al-Hawari, F., Al-Ashi, M., Abawi, F., & Alouneh, S. (2020). A practical three-phase ILP approach for solving the examination timetabling problem. International Transactions in Operational Research, 27(2), 924\u2013944.","journal-title":"International Transactions in Operational Research"},{"key":"778_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.02.011","volume":"61","author":"SM Al-Yakoob","year":"2015","unstructured":"Al-Yakoob, S. M., & Sherali, H. D. (2015). Mathematical models and algorithms for a high school timetabling problem. Computers & Operations Research, 61, 56\u201368.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"778_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10287-007-0066-8","volume":"7","author":"SM Al-Yakoob","year":"2010","unstructured":"Al-Yakoob, S. M., Sherali, H. D., & Al-Jazzaf, M. (2010). A mixed-integer mathematical modeling approach to exam timetabling. Computational Management Science, 7(1), 19.","journal-title":"Computational Management Science"},{"issue":"1","key":"778_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-015-1832-6","volume":"229","author":"T Arbaoui","year":"2015","unstructured":"Arbaoui, T., Boufflet, J. P., & Moukrim, A. (2015). Preprocessing and an improved MIP model for examination timetabling. Annals of Operations Research, 229(1), 19\u201340.","journal-title":"Annals of Operations Research"},{"key":"778_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.cor.2019.02.013","volume":"106","author":"T Arbaoui","year":"2019","unstructured":"Arbaoui, T., Boufflet, J. P., & Moukrim, A. (2019). Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems. Computers & Operations Research, 106, 133\u2013142.","journal-title":"Computers & Operations Research"},{"key":"778_CR7","doi-asserted-by":"crossref","unstructured":"Battistutta, M., Ceschia, S., De\u00a0Cesco, F., Di\u00a0Gaspero, L., Schaerf, A., & Topan, E. (2020). Local search and constraint programming for a real-world examination timetabling problem. In E. Hebrard, N. Musliu (Eds.). 17th International conference on the integration of constraint programming, artificial intelligence, and operations research (CPAIOR-2020), LNCS, Vol. 12296 (pp. 69\u201381). Springer.","DOI":"10.1007\/978-3-030-58942-4_5"},{"issue":"2","key":"778_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10479-015-2061-8","volume":"252","author":"M Battistutta","year":"2017","unstructured":"Battistutta, M., Schaerf, A., & Urli, T. (2017). Feature-based tuning of single-stage simulated annealing for examination timetabling. Annals of Operations Research, 252(2), 239\u2013254.","journal-title":"Annals of Operations Research"},{"key":"778_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2021.105300","volume":"132","author":"R Bellio","year":"2021","unstructured":"Bellio, R., Ceschia, S., Di Gaspero, L., & Schaerf, A. (2021). Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling. Computers and Operations Research, 132, 1\u20139.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"778_CR10","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"778_CR11","doi-asserted-by":"crossref","unstructured":"Bilgin, B., \u00d6zcan, E., & Korkmaz, E. E. (2006). An experimental study on hyper-heuristics and exam timetabling. In International conference on the practice and theory of automated timetabling (pp. 394\u2013412). Springer.","DOI":"10.1007\/978-3-540-77345-0_25"},{"key":"778_CR12","doi-asserted-by":"crossref","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., & St\u00fctzle, T. (2010). F-race and iterated F-race: An overview. In Experimental methods for the analysis of optimization algorithms (pp. 311\u2013336). Springer.","DOI":"10.1007\/978-3-642-02538-9_13"},{"issue":"1","key":"778_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10479-010-0707-0","volume":"194","author":"A Bonutti","year":"2012","unstructured":"Bonutti, A., De Cesco, F., Di Gaspero, L., & Schaerf, A. (2012). Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, visualization, and results. Annals of Operations Research, 194(1), 59\u201370.","journal-title":"Annals of Operations Research"},{"issue":"9","key":"778_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., & Kerbosch, J. (1973). Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 16(9), 575\u2013577.","journal-title":"Communications of the ACM"},{"issue":"4","key":"778_CR15","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1287\/ijoc.2015.0680","volume":"28","author":"EK Burke","year":"2016","unstructured":"Burke, E. K., & Bykov, Y. (2016). An adaptive flex-deluge approach to university exam timetabling. INFORMS Journal on Computing, 28(4), 781\u2013794.","journal-title":"INFORMS Journal on Computing"},{"key":"778_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"74","author":"MW Carter","year":"1996","unstructured":"Carter, M. W., Laporte, G., & Lee, S. Y. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of the Operational Research Society, 74, 373\u2013383.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"778_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10479-016-2321-2","volume":"258","author":"A Cataldo","year":"2017","unstructured":"Cataldo, A., Ferrer, J. C., Miranda, J., Rey, P. A., & Saur\u00e9, A. (2017). An integer programming approach to curriculum-based examination timetabling. Annals of Operations Research, 258(2), 369\u2013393.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"778_CR18","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2003.06.023","volume":"160","author":"S Daskalaki","year":"2005","unstructured":"Daskalaki, S., & Birbas, T. (2005). Efficient solutions for a university timetabling problem through integer programming. European Journal of Operational Research, 160(1), 106\u2013120.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"778_CR19","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s10601-017-9270-5","volume":"22","author":"JJ Dekker","year":"2017","unstructured":"Dekker, J. J., Bj\u00f6rdal, G., Carlsson, M., Flener, P., & Monette, J. (2017). Auto-tabling for subproblem presolving in MiniZinc. Constraints, 22(4), 512\u2013529.","journal-title":"Constraints"},{"key":"778_CR20","doi-asserted-by":"crossref","unstructured":"Dekker, J.J., de\u00a0la Banda, M.G., Schutt, A., Stuckey, P.J., & Tack, G. (2018). Solver-independent large neighbourhood search. In J. N. Hooker (Ed.) CP 2018, LNCS, Vol. 11008 (pp. 81\u201398). Springer.","DOI":"10.1007\/978-3-319-98334-9_6"},{"issue":"1","key":"778_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10951-011-0258-5","volume":"15","author":"P Demeester","year":"2012","unstructured":"Demeester, P., Bilgin, B., De Causmaecker, P., & Vanden Berghe, G. (2012). A hyperheuristic approach to examination timetabling problems: Benchmarks and a new problem from practice. Journal of Scheduling, 15(1), 83\u2013103.","journal-title":"Journal of Scheduling"},{"key":"778_CR22","unstructured":"Gecode Team. (2019). Gecode: A generic constraint development environment. The Gecode solver and its MiniZinc backend are available at https:\/\/www.gecode.org"},{"key":"778_CR23","doi-asserted-by":"crossref","unstructured":"Genc, B., & O\u2019Sullivan, B. (2020). A two-phase constraint programming model for examination timetabling at University College Cork. In International conference on principles and practice of constraint programming (pp. 724\u2013742). Springer.","DOI":"10.1007\/978-3-030-58475-7_42"},{"key":"778_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2021.115363","volume":"183","author":"MG G\u00fcler","year":"2021","unstructured":"G\u00fcler, M. G., Ge\u00e7ici, E., K\u00f6ro\u011flu, T., & Becit, E. (2021). A web-based decision support system for examination timetabling. Expert Systems with Applications, 183, 1\u201311.","journal-title":"Expert Systems with Applications"},{"key":"778_CR25","unstructured":"Gurobi Optimization, LLC. (2021). Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com"},{"key":"778_CR26","doi-asserted-by":"crossref","unstructured":"Hammersley, J. M., & Handscomb, D. C. (1964). Monte Carlo methods. Chapman and Hall.","DOI":"10.1007\/978-94-009-5819-7"},{"key":"778_CR27","doi-asserted-by":"crossref","unstructured":"June, T. L., Obit, J. H., Leau, Y. B., & Bolongkikit, J. (2019). Implementation of constraint programming and simulated annealing for examination timetabling problem. In R. Alfred, Y. Lim, A. Ibrahim, & P. Anthony (Eds.), Computational Science and Technology. Lecture Notes in Electrical Engineering (pp. 175\u2013184). Springer.","DOI":"10.1007\/978-981-13-2622-6_18"},{"issue":"2","key":"778_CR28","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.ejor.2010.04.011","volume":"207","author":"MM Kahar","year":"2010","unstructured":"Kahar, M. M., & Kendall, G. (2010). The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution. European Journal of Operational Research, 207(2), 557\u2013565.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"778_CR29","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1057\/jors.2012.169","volume":"66","author":"MM Kahar","year":"2015","unstructured":"Kahar, M. M., & Kendall, G. (2015). A great deluge algorithm for a real-world examination timetabling problem. Journal of the Operational Research Society, 66(1), 116\u2013133.","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"778_CR30","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1504\/EJIE.2018.096394","volume":"12","author":"ME Keskin","year":"2018","unstructured":"Keskin, M. E., D\u00f6yen, A., Akyer, H., & G\u00fcler, M. G. (2018). Examination timetabling problem with scarce resources: A case study. European Journal of Industrial Engineering, 12(6), 855\u2013874.","journal-title":"European Journal of Industrial Engineering"},{"issue":"4","key":"778_CR31","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10951-014-0405-x","volume":"18","author":"S Kristiansen","year":"2015","unstructured":"Kristiansen, S., S\u00f8rensen, M., & Stidsen, T. R. (2015). Integer programming for the generalized high school timetabling problem. Journal of Scheduling, 18(4), 377\u2013392.","journal-title":"Journal of Scheduling"},{"key":"778_CR32","doi-asserted-by":"crossref","unstructured":"Lach, G., & L\u00fcbbecke, M. E. (2008). Optimal university course timetables and the partial transversal polytope. In International workshop on experimental and efficient algorithms (pp. 235\u2013248). Springer.","DOI":"10.1007\/978-3-540-68552-4_18"},{"issue":"1","key":"778_CR33","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-010-0700-7","volume":"194","author":"G Lach","year":"2012","unstructured":"Lach, G., & L\u00fcbbecke, M. E. (2012). Curriculum based course timetabling: New solutions to Udine benchmark instances. Annals of Operations Research, 194(1), 255\u2013272.","journal-title":"Annals of Operations Research"},{"key":"778_CR34","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2018.02.009","volume":"94","author":"N Leite","year":"2018","unstructured":"Leite, N., Fernandes, C., Mel\u00edcio, F., & Rosa, A. (2018). A cellular memetic algorithm for the examination timetabling problem. Computers and Operations Research, 94, 118\u2013138.","journal-title":"Computers and Operations Research"},{"key":"778_CR35","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.eswa.2018.12.048","volume":"122","author":"N Leite","year":"2019","unstructured":"Leite, N., Mel\u00edcio, F., & Rosa, A. (2019). A fast simulated annealing algorithm for the examination timetabling problem. Expert Systems with Applications, 122, 137\u2013151.","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"778_CR36","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., & Zuckerman, D. (1993). Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47(4), 173\u2013180.","journal-title":"Information Processing Letters"},{"key":"778_CR37","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., Boschetti, M. A., & St\u00fctzle, T. (2021). Matheuristics: Algorithms and implementations. Springer.","DOI":"10.1007\/978-3-030-70277-9"},{"key":"778_CR38","unstructured":"McCollum, B., McMullan, P., Burke, E. K., Parkes, A. J., & Qu, R. (2007). The second international timetabling competition: Examination timetabling track. Technical Report. QUB\/IEEE\/Tech\/ITC2007\/Exam\/v4.0\/17. Queen\u2019s University."},{"key":"778_CR39","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.asoc.2017.01.026","volume":"55","author":"A Muklason","year":"2017","unstructured":"Muklason, A., Parkes, A. J., \u00d6zcan, E., McCollum, B., & McMullan, P. (2017). Fairness in examination timetabling: Student preferences and extended formulations. Applied Soft Computing, 55, 302-318.","journal-title":"Applied Soft Computing"},{"issue":"3","key":"778_CR40","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10951-014-0391-z","volume":"19","author":"T M\u00fcller","year":"2016","unstructured":"M\u00fcller, T. (2016). Real-life examination timetabling. Journal of Scheduling, 19(3), 257\u2013270.","journal-title":"Journal of Scheduling"},{"key":"778_CR41","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P. J., Becket, R., Brand, S., Duck, G. J., & Tack, G. (2007). MiniZinc: Towards a standard CP modelling language. In: C. Bessi\u00e8re (Ed). CP\u00a02007, LNCS, Vol .4741 (pp 529\u2013543). Springer, the MiniZinc toolchain is available at https:\/\/www.minizinc.org","DOI":"10.1007\/978-3-540-74970-7_38"},{"issue":"3","key":"778_CR42","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P. J., & Codish, M. (2009). Propagation via lazy clause generation. Constraints, 14(3), 357\u2013391.","journal-title":"Constraints"},{"key":"778_CR43","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., & Ersoy, E. (2005). Final exam scheduler-fes. In 2005 IEEE congress on evolutionary computation, Vol.\u00a02 (pp. 1356\u20131363). IEEE.","DOI":"10.1109\/CEC.2005.1554848"},{"key":"778_CR44","unstructured":"Parkes, A. J., & \u00d6zcan, E. (2010). Properties of Yeditepe examination timetabling benchmark instances. In Proceedings of the 8th international conference on the practice and theory of automated timetabling (pp 531\u2013534)."},{"issue":"1","key":"778_CR45","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R Qu","year":"2009","unstructured":"Qu, R., Burke, E. K., McCollum, B., Merlot, L., & Lee, S. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12(1), 55\u201389.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"778_CR46","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"778_CR47","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher, J. F. Puget (Eds.) CP\u00a01998, LNCS, Vol. 1520 (pp. 417\u2013431). Springer.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"778_CR48","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cor.2013.08.025","volume":"43","author":"M S\u00f8rensen","year":"2014","unstructured":"S\u00f8rensen, M., & Dahms, F. H. (2014). A two-stage decomposition of high school timetabling applied to cases in Denmark. Computers & Operations Research, 43, 36\u201349.","journal-title":"Computers & Operations Research"},{"key":"778_CR49","unstructured":"Stuckey, P. J., et\u00a0al. (2020). The MiniZinc Handbook, 2nd edn. Monash University. https:\/\/www.minizinc.org\/"},{"key":"778_CR50","unstructured":"Urli, T. (2013). json2run: A tool for experiment design & analysis. arXiv:1305.1112"},{"issue":"1","key":"778_CR51","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ejor.2016.01.046","volume":"253","author":"G Woumans","year":"2016","unstructured":"Woumans, G., De Boeck, L., Beli\u00ebn, J., & Creemers, S. (2016). A column generation approach for solving the examination-timetabling problem. European Journal of Operational Research, 253(1), 178\u2013194.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00778-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00778-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00778-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T09:04:13Z","timestamp":1689671053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00778-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,4]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["778"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00778-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,4]]},"assertion":[{"value":"20 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}