{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T12:10:24Z","timestamp":1743336624206,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031868481","type":"print"},{"value":"9783031868498","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-86849-8_5","type":"book-chapter","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:44:39Z","timestamp":1743335079000},"page":"66-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Instance Space Analysis and\u00a0Algorithm Selection for\u00a0a\u00a0Parallel Batch Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7026-4165","authenticated-orcid":false,"given":"Francesca","family":"Da Ros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-6086","authenticated-orcid":false,"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9916-9011","authenticated-orcid":false,"given":"Marie-Louise","family":"Lackner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3992-8637","authenticated-orcid":false,"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Azizoglu, M., Webster, S.: Scheduling a batch processing machine with incompatible job families. Comput. Ind. Eng. 39(3), 325\u2013335 (2001). ISSN 0360-8352. https:\/\/doi.org\/10.1016\/S0360-8352(01)00009-2","DOI":"10.1016\/S0360-8352(01)00009-2"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Cheng, B., Wang, Q., Yang, S., Hu, X.: An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes. Appl. Soft Comput. 13(2), 765\u2013772 (2013). ISSN 1568-4946. https:\/\/doi.org\/10.1016\/j.asoc.2012.10.021","DOI":"10.1016\/j.asoc.2012.10.021"},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1504\/EJIE.2013.057380","volume":"7","author":"FD Chou","year":"2013","unstructured":"Chou, F.D.: Minimising the total weighted tardiness for non-identical parallel batch processing machines with job release times and non-identical job sizes. Eur. J. Ind. Eng. 7(5), 529\u2013557 (2013). https:\/\/doi.org\/10.1504\/EJIE.2013.057380. pMID: 57380","journal-title":"Eur. J. Ind. Eng."},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Van De\u00a0Rzee, D.J., Van Harten, A., Schuur, P.: Dynamic job assignment heuristics for multi-server batch operations \u2013 a cost based approach. Int. J. Prod. Res. 35(11), 3063\u20133094 (1997). https:\/\/doi.org\/10.1080\/002075497194291","DOI":"10.1080\/002075497194291"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Da\u00a0Ros, F., Di\u00a0Gaspero, L., Lackner, M.L., Musliu, N.: Reducing energy consumption in electronic component manufacturing through large neighborhood search. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2024, pp. 1706\u20131714. Association for Computing Machinery, New York (2024). ISBN 9798400704956. https:\/\/doi.org\/10.1145\/3638530.3664132","DOI":"10.1145\/3638530.3664132"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Da\u00a0Ros, F., Di\u00a0Gaspero, L., Lackner, M.L., Musliu, N., Winter, F.: Local search algorithms for the oven scheduling problem. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2024, pp. 191\u2013194. Association for Computing Machinery, New York (2024). ISBN 9798400704956. https:\/\/doi.org\/10.1145\/3638530.3654158","DOI":"10.1145\/3638530.3654158"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Da Ros, F., Di Gaspero, L., Lackner, M.L., Musliu, N., Winter, F.: Multi-Neighborhood Simulated Annealing for the Oven Scheduling Problem (2024). https:\/\/doi.org\/10.2139\/ssrn.4998899","DOI":"10.2139\/ssrn.4998899"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Da\u00a0Ros, F., Lackner, M.L., Musliu, N.: Theoretical lower bounds for the oven scheduling problem. In: Proceedings of the 14th International Conference on the Practice and Theory of Automated Timetabling (2024). https:\/\/doi.org\/10.48550\/arXiv.2410.01368","DOI":"10.48550\/arXiv.2410.01368"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Damodaran, P., V\u00e9lez-Gallego, M.C.: A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. Expert Syst. Appl. 39(1), 1451\u20131458 (2012). ISSN 0957-4174. https:\/\/doi.org\/10.1016\/j.eswa.2011.08.029","DOI":"10.1016\/j.eswa.2011.08.029"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"De\u00a0Coster, A., Musliu, N., Schaerf, A., Schoisswohl, J., Smith-Miles, K.: Algorithm selection and instance space analysis for curriculum-based course timetabling. J. Sched. 25(1), 35\u201358 (2022). ISSN 1099-1425. https:\/\/doi.org\/10.1007\/s10951-021-00701-x","DOI":"10.1007\/s10951-021-00701-x"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Dwivedi, R., et al.: Explainable AI (XAI): core ideas, techniques, and solutions. ACM Comput. Surv. 55(9) (2023). ISSN 0360-0300. https:\/\/doi.org\/10.1145\/3561048","DOI":"10.1145\/3561048"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Fowler, J.W., M\u00f6nch, L.: A survey of scheduling with parallel batch (p-batch) processing. Eur. J. Oper. Res. 298(1), 1\u201324 (2022). ISSN 0377-2217. https:\/\/doi.org\/10.1016\/j.ejor.2021.06.012","DOI":"10.1016\/j.ejor.2021.06.012"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Franzin, A., St\u00fctzle, T.: Revisiting simulated annealing: a component-based analysis. Comput. Oper. Res. 104, 191\u2013206 (2019). ISSN 0305-0548. https:\/\/doi.org\/10.1016\/j.cor.2018.12.015","DOI":"10.1016\/j.cor.2018.12.015"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Geibinger, T., Kletzander, L., Musliu, N.: Instance space analysis for the generalized assignment problem. In: Di\u00a0Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds.) Metaheuristics, pp. 421\u2013435. Springer, Cham (2023). ISBN 978-3-031-26504-4. https:\/\/doi.org\/10.1007\/978-3-031-26504-4_30","DOI":"10.1007\/978-3-031-26504-4_30"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the Python in Science Conferences, pp. 11\u201315 (2008). https:\/\/doi.org\/10.25080\/tcwv9851","DOI":"10.25080\/tcwv9851"},{"issue":"7825","key":"5_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris, C.R., et al.: Array programming with NumPy. Nature 585(7825), 357\u2013362 (2020). https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Fowler, J.W., Phojanamongkolkij, N., Cochran, J.K., Montgomery, D.C.: Optimal batching in a wafer fabrication facility using a multiproduct G\/G\/C model with batch processing. Int. J. Prod. Res. 40(2), 275\u2013292 (2002). https:\/\/doi.org\/10.1080\/00207540110081489","DOI":"10.1080\/00207540110081489"},{"issue":"4598","key":"5_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Kletzander, L., Musliu, N., Smith-Miles, K.: Instance space analysis for a personnel scheduling problem. Ann. Math. Artif. Intell. 89(7), 617\u2013637 (2021). ISSN 1573-7470. https:\/\/doi.org\/10.1007\/s10472-020-09695-2","DOI":"10.1007\/s10472-020-09695-2"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-07046-9_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Kosch","year":"2014","unstructured":"Kosch, S., Beck, J.C.: A new MIP model for parallel-batch scheduling with non-identical job sizes. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 55\u201370. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07046-9_5"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Krim, H., Zufferey, N., Potvin, J.Y., Benmansour, R., Duvivier, D.: Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. J. Sched. 25(1), 89\u2013105 (2022). ISSN 1099-1425. https:\/\/doi.org\/10.1007\/s10951-021-00711-9","DOI":"10.1007\/s10951-021-00711-9"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling. Constraints 23(2), 210\u2013250 (2018). ISSN 1572-9354. https:\/\/doi.org\/10.1007\/s10601-018-9281-x","DOI":"10.1007\/s10601-018-9281-x"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Lackner, M.L., Mrkvicka, C., Musliu, N., Walkiewicz, D., Winter, F.: Benchmark instances and models for the Oven Scheduling Problem [Dataset] (2022). https:\/\/doi.org\/10.5281\/zenodo.7456937","DOI":"10.5281\/zenodo.7456937"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Lackner, M.L., Mrkvicka, C., Musliu, N., Walkiewicz, D., Winter, F.: Exact methods for the oven scheduling problem. Constraints 28(2), 320\u2013361 (2023). ISSN 1572-9354. https:\/\/doi.org\/10.1007\/s10601-023-09347-2","DOI":"10.1007\/s10601-023-09347-2"},{"key":"5_CR25","unstructured":"Lackner, M.L., Musliu, N., Winter, F.: Solving an industrial oven scheduling problem with a simulated annealing approach. In: Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling, pp. 115\u2013120 (2022)"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Lundberg, S.M., et al.: From local explanations to global understanding with explainable AI for trees. Nat. Mach. Intell. 2(1), 56\u201367 (2020). ISSN 2522-5839. https:\/\/doi.org\/10.1038\/s42256-019-0138-9","DOI":"10.1038\/s42256-019-0138-9"},{"key":"5_CR27","unstructured":"Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a030, Curran Associates, Inc. (2017). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/8a20a8621978632d76c43dfd28b67767-Paper.pdf"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Melouk, S., Damodaran, P., Chang, P.Y.: Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. Int. J. Prod. Econ. 87(2), 141\u2013147 (2004). ISSN 0925-5273. https:\/\/doi.org\/10.1016\/S0925-5273(03)00092-6","DOI":"10.1016\/S0925-5273(03)00092-6"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"M\u00f6nch, L., Fowler, J.W., Mason, S.J.: Production planning and control for semiconductor wafer fabrication facilities: modeling, analysis, and systems, vol.\u00a052. Springer (2012)","DOI":"10.1007\/978-1-4614-4472-5"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, M.A., Smith-Miles, K.A.: Performance analysis of continuous black-box optimization algorithms via footprints in instance space. Evol. Comput. 25(4), 529-554 (2017). ISSN 1063-6560. https:\/\/doi.org\/10.1162\/evco_a_00194","DOI":"10.1162\/evco_a_00194"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, M.A., et al.: An instance space analysis of regression problems. ACM Trans. Knowl. Discov. Data 15(2) (2021). ISSN 1556-4681. https:\/\/doi.org\/10.1145\/3436893","DOI":"10.1145\/3436893"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, M.A., Villanova, L., Baatar, D., Smith-Miles, K.: Instance spaces for machine learning classification. Mach. Learn. 107(1), 109\u2013147 (2018). ISSN 1573-0565. https:\/\/doi.org\/10.1007\/s10994-017-5629-5","DOI":"10.1007\/s10994-017-5629-5"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, M.A., neelofarhassan, Christiansen, J.: andremun\/instancespace: February 2023 (2023). https:\/\/doi.org\/10.5281\/zenodo.7700434","DOI":"10.5281\/zenodo.7700434"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, M.A., Smith-Miles, K.: Generating new space-filling test instances for continuous black-box optimization. Evol. Comput. 28(3), 379\u2013404 (2020). ISSN 1063-6560. https:\/\/doi.org\/10.1162\/evco_a_00262","DOI":"10.1162\/evco_a_00262"},{"issue":"4","key":"5_CR35","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1109\/TSE.2022.3228334","volume":"49","author":"N Neelofar","year":"2023","unstructured":"Neelofar, N., Smith-Miles, K., Mu\u00f1oz, M.A., Aleti, A.: Instance space analysis of search-based software testing. IEEE Trans. Software Eng. 49(4), 2642\u20132660 (2023). https:\/\/doi.org\/10.1109\/TSE.2022.3228334","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"5_CR36","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1109\/TR.2018.2832072","volume":"67","author":"C Oliveira","year":"2018","unstructured":"Oliveira, C., Aleti, A., Grunske, L., Smith-Miles, K.: Mapping the effectiveness of automated test suite generation techniques. IEEE Trans. Reliab. 67(3), 771\u2013785 (2018). https:\/\/doi.org\/10.1109\/TR.2018.2832072","journal-title":"IEEE Trans. Reliab."},{"key":"5_CR37","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011). http:\/\/jmlr.org\/papers\/v12\/pedregosa11a.html"},{"key":"5_CR38","doi-asserted-by":"publisher","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228\u2013249 (2000). ISSN 0377-2217. https:\/\/doi.org\/10.1016\/S0377-2217(99)00153-8","DOI":"10.1016\/S0377-2217(99)00153-8"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976). ISSN 0065-2458. https:\/\/doi.org\/10.1016\/S0065-2458(08)60520-3","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, CP 1998, pp. 417\u2013431. Springer, Heidelberg (1998). ISBN 3540652248","DOI":"10.1007\/3-540-49481-2_30"},{"key":"5_CR41","doi-asserted-by":"publisher","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., Lewis, R.: Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. 45, 12\u201324 (2014). ISSN 0305-0548. https:\/\/doi.org\/10.1016\/j.cor.2013.11.015","DOI":"10.1016\/j.cor.2013.11.015"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Smith-Miles, K., Mu\u00f1oz, M.A.: Instance space analysis for algorithm testing: methodology and software tools. ACM Comput. Surv. 55(12) (2023). ISSN 0360-0300. https:\/\/doi.org\/10.1145\/3572895","DOI":"10.1145\/3572895"},{"key":"5_CR43","doi-asserted-by":"publisher","unstructured":"Strassl, S., Musliu, N.: Instance space analysis and algorithm selection for the job shop scheduling problem. Comput. Oper. Res. 141, 105661 (2022). ISSN 0305-0548. https:\/\/doi.org\/10.1016\/j.cor.2021.105661","DOI":"10.1016\/j.cor.2021.105661"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-53262-8_15","volume-title":"Combinatorial Optimization","author":"RS Trindade","year":"2020","unstructured":"Trindade, R.S., de Ara\u00fajo, O., Fampa, M.: Arc-flow approach for parallel batch processing machine scheduling with non-identical job sizes. In: Ba\u00efou, M., Gendron, B., G\u00fcnl\u00fck, O., Mahjoub, A.R. (eds.) ISCO 2020. LNCS, vol. 12176, pp. 179\u2013190. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53262-8_15"},{"key":"5_CR45","doi-asserted-by":"publisher","unstructured":"Wang, H.M., Chou, F.D.: Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics. Expert Syst. Appl. 37(2), 1510\u20131521 (2010). ISSN 0957-4174. https:\/\/doi.org\/10.1016\/j.eswa.2009.06.070","DOI":"10.1016\/j.eswa.2009.06.070"},{"key":"5_CR46","doi-asserted-by":"publisher","unstructured":"Waskom, M.L.: seaborn: statistical data visualization. J. Open Source Softw. 6(60), 3021 (2021). https:\/\/doi.org\/10.21105\/joss.03021","DOI":"10.21105\/joss.03021"},{"key":"5_CR47","doi-asserted-by":"publisher","unstructured":"\u00c7elik, C., Saricicek, I.: Tabu search for parallel machine scheduling with job splitting. In: 2009 Sixth International Conference on Information Technology: New Generations, pp. 183\u2013188 (2009). https:\/\/doi.org\/10.1109\/ITNG.2009.271","DOI":"10.1109\/ITNG.2009.271"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86849-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:44:59Z","timestamp":1743335099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86849-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031868481","9783031868498"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86849-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2025a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}