{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:20:39Z","timestamp":1759882839061,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712255.3734284","type":"proceedings-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T15:23:44Z","timestamp":1754925824000},"page":"2224-2232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Constrained Programming with Genetic Algorithm for the Job Shop Scheduling Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7398-1908","authenticated-orcid":false,"given":"Alessandro","family":"Lorenzi","sequence":"first","affiliation":[{"name":"University of Trento, Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2417-0319","authenticated-orcid":false,"given":"Stefano","family":"Genetti","sequence":"additional","affiliation":[{"name":"University of Trento, Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1581-6086","authenticated-orcid":false,"given":"Chiara Camilla","family":"Rambaldi Migliore","sequence":"additional","affiliation":[{"name":"University of Trento, Trento, Italy"},{"name":"University of Pisa, Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9483-3940","authenticated-orcid":false,"given":"Marco","family":"Roveri","sequence":"additional","affiliation":[{"name":"University of Trento, Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9723-1830","authenticated-orcid":false,"given":"Giovanni","family":"Iacca","sequence":"additional","affiliation":[{"name":"University of Trento, Trento, Italy"}]}],"member":"320","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The shifting bottleneck procedure for job shop scheduling. Management science 34, 3","author":"Adams Joseph","year":"1988","unstructured":"Joseph Adams, Egon Balas, and Daniel Zawack. 1988. The shifting bottleneck procedure for job shop scheduling. Management science 34, 3 (1988), 391\u2013401."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-024-09540-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.2.149"},{"volume-title":"Principles of sequencing and scheduling","author":"Baker Kenneth R","key":"e_1_3_2_1_4_1","unstructured":"Kenneth R Baker and Dan Trietsch. 2018. Principles of sequencing and scheduling. John Wiley & Sons, Oxford, UK."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20895-9_33"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58475-7_4"},{"volume-title":"Handbook on scheduling","author":"Blazewicz Jacek","key":"e_1_3_2_1_7_1","unstructured":"Jacek Blazewicz, Klaus Ecker, Erwin Pesch, G\u00fcnter Schmidt, and J Weglarz. 2019. Handbook on scheduling. Springer, Cham, Switzerland."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2023067"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.7.5.621"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90174-L"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(82)80007-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.35.2.164"},{"volume-title":"The Gantt chart: A working tool of management","author":"Clark Wallace","key":"e_1_3_2_1_13_1","unstructured":"Wallace Clark. 1922. The Gantt chart: A working tool of management. Ronald Press Company, London, UK."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.306.30"},{"key":"e_1_3_2_1_15_1","volume-title":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz). Springer","author":"Col Giacomo Da","year":"2016","unstructured":"Giacomo Da Col and Erich C Teppan. 2016. Declarative decomposition and dispatching for large-scale job-shop scheduling. In Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz). Springer, Cham, Switzerland, 134\u2013140."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2022.100249"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125895"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104230"},{"volume-title":"International Colloquium on Logistics and Supply Chain Management","author":"Elkhyari Abdallah","key":"e_1_3_2_1_19_1","unstructured":"Abdallah Elkhyari and Adil Bellabdaoui. 2017. Combining constraint programming and genetic algorithm for dynamic scheduling problems. In International Colloquium on Logistics and Supply Chain Management. IEEE, New York, NY, US, 19\u201324."},{"key":"e_1_3_2_1_20_1","volume-title":"International Conference on Computer Aided Systems Theory. Springer","author":"Frohner Nikolaus","year":"2019","unstructured":"Nikolaus Frohner, Stephan Teuschl, and G\u00fcnther R Raidl. 2019. Casual employee scheduling with constraint programming and metaheuristics. In International Conference on Computer Aided Systems Theory. Springer, Cham, Switzerland, 279\u2013287."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.06.004"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"e_1_3_2_1_23_1","unstructured":"Aaron Garrett. 2012. inspyred: Bio-inspired Algorithms in Python. https:\/\/pythonhosted.org\/inspyred\/"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-024-00821-0"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.03.012"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108586"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41635"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.37398\/JSR.2020.640157"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108016"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.04.006"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12599-014-0334-4"},{"key":"e_1_3_2_1_32_1","unstructured":"SR Lawrence. 1984. An Experimental Investigation of Heuristic Scheduling Techniques."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70821-5"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.3390\/technologies6040107"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2007.453"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.2.219"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5267\/j.ijiec.2024.3.001"},{"key":"e_1_3_2_1_38_1","unstructured":"MiniZinc. 2013. MiniZinc Benchmarks: Jobshop. https:\/\/github.com\/MiniZinc\/minizinc-benchmarks\/tree\/master\/jobshop"},{"key":"e_1_3_2_1_39_1","volume-title":"Gerald Luther Thompson, and Peter R Winters","author":"Muth John F","year":"1963","unstructured":"John F Muth, Gerald Luther Thompson, and Peter R Winters. 1963. Industrial scheduling. Prentice-Hall, Englewood Cliffs, NJ, US."},{"key":"e_1_3_2_1_40_1","volume-title":"Conventional genetic algorithm for job shop problems. In International Conference on Genetic Algorithms","volume":"91","author":"Nakano Ryohei","year":"1991","unstructured":"Ryohei Nakano and Takeshi Yamada. 1991. Conventional genetic algorithm for job shop problems. In International Conference on Genetic Algorithms, Vol. 91. Morgan Kaufmann, San Francisco, CA, US, 474\u2013479."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.07.011"},{"key":"e_1_3_2_1_43_1","unstructured":"Laurent Perron and Fr\u00e9d\u00e9ric Didier. 2024. CP-SAT. Google. https:\/\/developers.google.com\/optimization\/cp\/cp_solver\/"},{"key":"e_1_3_2_1_44_1","unstructured":"Laurent Perron and Vincent Furnon. 2024. OR-Tools. Google. https:\/\/developers.google.com\/optimization\/"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2018.8560344"},{"key":"e_1_3_2_1_46_1","volume-title":"Peter Van Beek, and Toby Walsh","author":"Rossi Francesca","year":"2006","unstructured":"Francesca Rossi, Peter Van Beek, and Toby Walsh. 2006. Handbook of constraint programming. Elsevier, Amsterdam, The Netherlands."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00098-4"},{"key":"e_1_3_2_1_48_1","unstructured":"Mikhail Shirokikh Ilya Shenbin Anton Alekseev and Sergey Nikolenko. 2023. Machine learning for SAT: Restricted heuristics and new graph representations. arXiv preprint arXiv:2307.09141."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/2912955.2912963"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v35i2.2539"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111698"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.108"},{"key":"e_1_3_2_1_53_1","first-page":"385","article-title":"Metaheuristics: from design to implementation. John Wiley & Sons, Oxford, UK","volume":"5","author":"Talbi El-Ghazali","year":"2009","unstructured":"El-Ghazali Talbi. 2009. Metaheuristics: from design to implementation. John Wiley & Sons, Oxford, UK, Chapter 5, 385\u2013459.","journal-title":"Chapter"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v33i1.27243"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/CINTI.2014.7028706"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.1.113"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800060205"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.10.020"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00137-9"},{"volume-title":"PPSN","author":"Yamada Takeshi","key":"e_1_3_2_1_60_1","unstructured":"Takeshi Yamada and Ryohei Nakano. 1992. A genetic algorithm applicable to large-scale job-shop problems. In PPSN, Vol. 2. Elsevier, Amsterdam, The Netherlands, 281\u2013290."}],"event":{"name":"GECCO '25 Companion: Genetic and Evolutionary Computation Conference Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25 Companion"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712255.3734284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:10:50Z","timestamp":1759839050000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712255.3734284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":60,"alternative-id":["10.1145\/3712255.3734284","10.1145\/3712255"],"URL":"https:\/\/doi.org\/10.1145\/3712255.3734284","relation":{},"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"2025-08-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}