{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T04:17:53Z","timestamp":1745381873603,"version":"3.40.4"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031900617","type":"print"},{"value":"9783031900624","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-90062-4_5","type":"book-chapter","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T17:23:25Z","timestamp":1745342605000},"page":"68-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Search Trajectory Networks Applied to\u00a0a\u00a0Real-World Parallel 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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7337-7592","authenticated-orcid":false,"given":"Michael","family":"Soprano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Akbay, M.A., Blum, C.: Two examples for the usefulness of STNWeb for analyzing optimization algorithm behavior. In: Sevaux, M., Olteanu, A.L., Pardo, E.G., Sifaleras, A., Makboul, S. (eds.) Metaheuristics, pp. 341\u2013346. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62922-8_25","DOI":"10.1007\/978-3-031-62922-8_25"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Alza, J., Bartlett, M., Ceberio, J., McCall, J.: Analysing the fitness landscape rotation for combinatorial optimisation. In: Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G., Tu\u0161ar, T. (eds.) Parallel Problem Solving from Nature \u2013 PPSN XVII, pp. 533\u2013547. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14714-2_37","DOI":"10.1007\/978-3-031-14714-2_37"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0360-8352(01)00009-2","volume":"39","author":"M Azizoglu","year":"2001","unstructured":"Azizoglu, M., Webster, S.: Scheduling a batch processing machine with incompatible job families. Comput. Ind. Eng. 39(3), 325\u2013335 (2001). https:\/\/doi.org\/10.1016\/S0360-8352(01)00009-2","journal-title":"Comput. Ind. Eng."},{"key":"5_CR4","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"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Chacon-Sartori, C., Blum, C.: Boosting a genetic algorithm with graph neural networks for multi-hop influence maximization in social networks. In: 2022 17th Conference on Computer Science and Intelligence Systems (FedCSIS), pp. 363\u2013371 (2022). https:\/\/doi.org\/10.15439\/2022F78","DOI":"10.15439\/2022F78"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Chacon-Sartori, C., Blum, C., Ochoa, G.: Search trajectory networks meet the web: a web application for the visual comparison of optimization algorithms. In: Proceedings of the 2023 12th International Conference on Software and Computer Applications. ICSCA \u201923, New York, NY, USA, pp. 89\u201396. Association for Computing Machinery (2023). https:\/\/doi.org\/10.1145\/3587828.3587843","DOI":"10.1145\/3587828.3587843"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Chacon-Sartori, C., Blum, C., Ochoa, G.: An extension of STNWeb functionality: on the use of hierarchical agglomerative clustering as an advanced search space partitioning strategy. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO \u201924, New York, NY, USA, pp. 151\u2013159, Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3638529.3654084","DOI":"10.1145\/3638529.3654084"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Chac\u00f3n\u00a0Sartori, C., Blum, C., Ochoa, G.: Large Language Models for the Automated Analysis of Optimization Algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 160\u2013168, GECCO \u201924, Association for Computing Machinery, New York, NY, USA (2024). https:\/\/doi.org\/10.1145\/3638529.3654086","DOI":"10.1145\/3638529.3654086"},{"issue":"19","key":"5_CR9","doi-asserted-by":"publisher","first-page":"4211","DOI":"10.1080\/00207540410001711863","volume":"42","author":"PY Chang","year":"2004","unstructured":"Chang, P.Y., Damodaran, P., Melouk, S.: Minimizing makespan on parallel batch processing machines. Int. J. Prod. Res. 42(19), 4211\u20134220 (2004). https:\/\/doi.org\/10.1080\/00207540410001711863","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.asoc.2012.10.021","volume":"13","author":"B Cheng","year":"2013","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). https:\/\/doi.org\/10.1016\/j.asoc.2012.10.021","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"5_CR11","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","journal-title":"Eur. J. Ind. Eng."},{"key":"5_CR12","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 \u201924 Companion, New York, NY, USA, pp. 1706\u20131714. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3638530.3664132","DOI":"10.1145\/3638530.3664132"},{"key":"5_CR13","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 \u201924 Companion, New York, NY, USA, pp. 191\u2013194. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3638530.3654158","DOI":"10.1145\/3638530.3654158"},{"key":"5_CR14","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"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.rcim.2006.02.012","volume":"23","author":"P Damodaran","year":"2007","unstructured":"Damodaran, P., Srihari, K., Lam, S.S.: Scheduling a capacitated batch-processing machine to minimize makespan. Robot. Comput.-Integr. Manuf. 23(2), 208\u2013216 (2007). https:\/\/doi.org\/10.1016\/j.rcim.2006.02.012","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1016\/j.eswa.2011.08.029","volume":"39","author":"P Damodaran","year":"2012","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). https:\/\/doi.org\/10.1016\/j.eswa.2011.08.029","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/00207540110081489","volume":"40","author":"JW Fowler","year":"2002","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","journal-title":"Int. J. Prod. Res."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cor.2018.12.015","volume":"104","author":"A Franzin","year":"2019","unstructured":"Franzin, A., St\u00fctzle, T.: Revisiting simulated annealing: a component-based analysis. Comput. Oper. Res. 104, 191\u2013206 (2019). https:\/\/doi.org\/10.1016\/j.cor.2018.12.015","journal-title":"Comput. Oper. Res."},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software Pract. Exper. 21(11), 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","DOI":"10.1002\/spe.4380211102"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Hu, T., Ochoa, G., Banzhaf, W.: Phenotype search trajectory networks for linear genetic programming. In: Pappa, G., Giacobini, M., Vasicek, Z. (eds.) Genetic Programming, pp. 52\u201367. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-29573-7_4","DOI":"10.1007\/978-3-031-29573-7_4"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7\u201315 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90102-6","journal-title":"Inf. Process. Lett."},{"issue":"4598","key":"5_CR22","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_CR23","doi-asserted-by":"publisher","unstructured":"Kosch, S., Beck, J.C.: A New MIP model for parallel-batch scheduling with non-identical job sizes. In: Simonis, H. (ed.) Integration of AI and OR Techniques in Constraint Programming, pp. 55\u201370, Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07046-9_5","DOI":"10.1007\/978-3-319-07046-9_5"},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10951-021-00711-9","volume":"25","author":"H Krim","year":"2021","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 (2021). https:\/\/doi.org\/10.1007\/s10951-021-00711-9","journal-title":"J. Sched."},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling. Constraints 23(2), 210\u2013250 (2018). https:\/\/doi.org\/10.1007\/s10601-018-9281-x","journal-title":"Constraints"},{"key":"5_CR26","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"},{"issue":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s10601-023-09347-2","volume":"28","author":"ML Lackner","year":"2023","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). https:\/\/doi.org\/10.1007\/s10601-023-09347-2","journal-title":"Constraints"},{"key":"5_CR28","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_CR29","doi-asserted-by":"publisher","unstructured":"Lavinas, Y., Aranha, C., Ochoa, G.: search trajectories networks of multiobjective evolutionary algorithms. In: Jim\u00e9nez\u00a0Laredo, J.L., Hidalgo, J.I., Babaagba, K.O. (eds.) Applications of Evolutionary Computation, pp. 223\u2013238. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-02462-7_15","DOI":"10.1007\/978-3-031-02462-7_15"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1504\/IJOR.2008.016157","volume":"3","author":"CS Mazumdar","year":"2008","unstructured":"Mazumdar, C.S., Mathirajan, M., Gopinath, R., Sivakumar, A.I.: Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints. Int. J. Oper. Res. 3, 119\u2013139 (2008). https:\/\/doi.org\/10.1504\/IJOR.2008.016157","journal-title":"Int. J. Oper. Res."},{"issue":"2","key":"5_CR31","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","volume":"87","author":"S Melouk","year":"2004","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). https:\/\/doi.org\/10.1016\/S0925-5273(03)00092-6","journal-title":"Int. J. Prod. Econ."},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"151266","DOI":"10.1109\/ACCESS.2021.3126015","volume":"9","author":"V Narvaez-Teran","year":"2021","unstructured":"Narvaez-Teran, V., Ochoa, G., Rodriguez-Tello, E.: Search trajectory networks applied to the cyclic bandwidth sum problem. IEEE Access 9, 151266\u2013151277 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3126015","journal-title":"IEEE Access"},{"key":"5_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107492","volume":"109","author":"G Ochoa","year":"2021","unstructured":"Ochoa, G., Malan, K.M., Blum, C.: Search trajectory networks: a tool for analysing and visualising the behaviour of metaheuristics. Appl. Soft Comput. 109, 107492 (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107492","journal-title":"Appl. Soft Comput."},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Ochoa, G., Tomassini, M., V\u00e9rel, S., Darabos, C.: A study of NK landscapes\u2019 basins and local optima networks. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation. GECCO \u201908, New York, NY, USA, pp. 555\u2013562. Association for Computing Machinery (2008). https:\/\/doi.org\/10.1145\/1389095.1389204","DOI":"10.1145\/1389095.1389204"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Riveros, M., Rojas-Morales, N., Montero, E., Ochoa, G.: Understanding search trajectories in parameter tuning. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO \u201924, New York, NY, USA, pp. 778\u2013786. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3638529.3654146","DOI":"10.1145\/3638529.3654146"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Sarti, S., Adair, J., Ochoa, G.: Neuroevolution trajectory networks of the behaviour space. In: Jim\u00e9nez\u00a0Laredo, J.L., Hidalgo, J.I., Babaagba, K.O. (eds.) Applications of Evolutionary Computation, pp. 685\u2013703. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-02462-7_43","DOI":"10.1007\/978-3-031-02462-7_43"},{"issue":"3","key":"5_CR37","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J.l 27(3), 379\u2013423 (1948). https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst. Tech. J.l"},{"key":"5_CR38","doi-asserted-by":"publisher","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, pp. 417\u2013431, CP \u201998. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30","DOI":"10.1007\/3-540-49481-2_30"},{"key":"5_CR39","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). https:\/\/doi.org\/10.1145\/3572895","DOI":"10.1145\/3572895"},{"issue":"1","key":"5_CR40","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen, K.: Metaheuristics\u2013the metaphor exposed. Int. Trans. Oper. Res. 22(1), 3\u201318 (2015). https:\/\/doi.org\/10.1111\/itor.12001","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"5_CR41","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.05.042","volume":"297","author":"J Swan","year":"2022","unstructured":"Swan, J., et al.: Metaheuristics \u201cIn the Large\u2019\u2019. Eur. J. Oper. Res. 297(2), 393\u2013406 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.05.042","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Tang, T.Y., Beck, J.C.: CP and hybrid models for two-stage batching and scheduling. In: Hebrard, E., Musliu, N. (eds.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 431\u2013446. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_28","DOI":"10.1007\/978-3-030-58942-4_28"},{"issue":"2","key":"5_CR43","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2020.10.045","volume":"292","author":"R Turke\u0161","year":"2021","unstructured":"Turke\u0161, R., S\u00f6rensen, K., Hvattum, L.M.: Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search. Eur. J. Oper. Res. 292(2), 423\u2013442 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.10.045","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"5_CR44","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TEVC.2010.2046175","volume":"15","author":"S Verel","year":"2011","unstructured":"Verel, S., Ochoa, G., Tomassini, M.: Local optima networks of NK landscapes with neutrality. IEEE Trans. Evol. Comput. 15(6), 783\u2013797 (2011). https:\/\/doi.org\/10.1109\/TEVC.2010.2046175","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"5_CR45","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1016\/j.eswa.2009.06.070","volume":"37","author":"HM Wang","year":"2010","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). https:\/\/doi.org\/10.1016\/j.eswa.2009.06.070","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"5_CR46","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1109\/TASE.2019.2953669","volume":"17","author":"Z Zhao","year":"2020","unstructured":"Zhao, Z., Liu, S., Zhou, M., Guo, X., Qi, L.: Decomposition method for new single-machine scheduling problems from steel production systems. IEEE Trans. Autom. Sci. Eng. 17(3), 1376\u20131387 (2020). https:\/\/doi.org\/10.1109\/TASE.2019.2953669","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"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-90062-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T17:23:28Z","timestamp":1745342608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90062-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031900617","9783031900624"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90062-4_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":"17 April 2025","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":"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":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}