{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T05:45:53Z","timestamp":1776836753775,"version":"3.51.2"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T00:00:00Z","timestamp":1677542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Austrian Federal Ministry for Digital and Economic Affairs"},{"DOI":"10.13039\/100010132","name":"National Foundation for Research, Technology and Development","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100010132","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006012","name":"Christian Doppler Research Association","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006012","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2023,2,28]]},"abstract":"<jats:p>\n            Automated scheduling solutions are tremendously important for the efficient operation of industrial laboratories. The\n            <jats:bold>Test Laboratory Scheduling Problem (TLSP)<\/jats:bold>\n            is an extension of the well-known\n            <jats:bold>Resource<\/jats:bold>\n            <jats:bold>Constrained Project Scheduling Problem (RCPSP)<\/jats:bold>\n            and captures the specific requirements of such laboratories. In addition to several new scheduling constraints, it features a grouping phase, where the jobs to be scheduled are assembled from smaller units. In this work, we introduce an innovative scheduling system that allows the efficient and flexible generation of schedules for TLSP. It features a new Constraint Programming model that covers both the grouping and the scheduling aspect, as well as a hybrid Very Large Neighborhood Search that internally uses the CP model. Our experimental results on generated and real-world benchmark instances show that good results can be obtained even compared to settings which have a good grouping already provided, including several new best known solutions for these instances. Our algorithms for TLSP have been successfully implemented in a real-world industrial test laboratory. We provide a detailed description of the deployed system as well as additional useful soft constraints supported by the solvers and general lessons learned. This includes a discussion of the choice of soft constraint weights, with an analysis on the impact and relation of different objectives to each other. Our experiments show that some soft constraints complement each other well, while others require explicit trade-offs via their relative weights.\n          <\/jats:p>","DOI":"10.1145\/3546871","type":"journal-article","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:46:32Z","timestamp":1659354392000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A System for Automated Industrial Test Laboratory Scheduling"],"prefix":"10.1145","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2209-1516","authenticated-orcid":false,"given":"Philipp","family":"Danzinger","sequence":"first","affiliation":[{"name":"Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, TU Wien, Vienna, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0856-7162","authenticated-orcid":false,"given":"Tobias","family":"Geibinger","sequence":"additional","affiliation":[{"name":"Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, TU Wien, Vienna, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6510-7317","authenticated-orcid":false,"given":"David","family":"Janneau","sequence":"additional","affiliation":[{"name":"Robert Bosch AG, Vienna, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1166-3881","authenticated-orcid":false,"given":"Florian","family":"Mischek","sequence":"additional","affiliation":[{"name":"Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, TU Wien, Vienna, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3992-8637","authenticated-orcid":false,"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[{"name":"Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, TU Wien, Vienna, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3390-0278","authenticated-orcid":false,"given":"Christian","family":"Poschalko","sequence":"additional","affiliation":[{"name":"Robert Bosch AG, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90068-A"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.11.010"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/11593577_14"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00204-5"},{"key":"e_1_3_3_6_2","volume-title":"Improving Combinatorial Optimization","author":"Chu Geoffrey","year":"2011","unstructured":"Geoffrey Chu. 2011. Improving Combinatorial Optimization. Ph.D. Dissertation. University of Melbourne, Australia. http:\/\/hdl.handle.net\/11343\/36679."},{"key":"e_1_3_3_7_2","first-page":"357","volume-title":"Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020)","author":"Danzinger Philipp","year":"2020","unstructured":"Philipp Danzinger, Tobias Geibinger, Florian Mischek, and Nysret Musliu. 2020. Solving the test laboratory scheduling problem with variable task grouping. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020). AAAI Press, 357\u2013365. https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/6681."},{"key":"e_1_3_3_8_2","volume-title":"Proceedings of ModRef 2017: The Sixteenth International Workshop on Constraint Modelling and Reformulation at CP 2017","author":"Feydy Thibaut","year":"2017","unstructured":"Thibaut Feydy, Adrian Goldwaser, Andreas Schutt, Peter J. Stuckey, and Kenneth D. Young. 2017. Priority search with MiniZinc. In Proceedings of ModRef 2017: The Sixteenth International Workshop on Constraint Modelling and Reformulation at CP 2017. https:\/\/ozgurakgun.github.io\/ModRef2017\/files\/ModRef2017_PrioritySearchWithMiniZinc.pdf."},{"key":"e_1_3_3_9_2","doi-asserted-by":"crossref","unstructured":"Tobias Geibinger Florian Mischek and Nysret Musliu. 2019. Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling. (2019). https:\/\/arxiv.org\/abs\/1911.04766.","DOI":"10.1007\/978-3-030-19212-9_20"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19212-9_20"},{"key":"e_1_3_3_11_2","volume-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 21)","author":"Geibinger Tobias","year":"2021","unstructured":"Tobias Geibinger, Florian Mischek, and Nysret Musliu. 2021. Constraint logic programming for real-world test laboratory scheduling. In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 21)."},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.11.005"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.04.008"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05443-8_21"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.069"},{"key":"e_1_3_3_17_2","volume-title":"The Test Laboratory Scheduling Problem","author":"Mischek Florian","year":"2018","unstructured":"Florian Mischek and Nysret Musliu. 2018. The Test Laboratory Scheduling Problem. Technical Report. Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, TU Wien, CD-TR 2018\/1. https:\/\/www.dbai.tuwien.ac.at\/staff\/fmischek\/TLSP\/TLSP.pdf."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-021-04007-1"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-021-00699-2"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"e_1_3_3_21_2","volume-title":"Proceedings of the 47th International Conference on Computers & Industrial Engineering (CIE47)","author":"Mejia Oliver Polo","year":"2017","unstructured":"Oliver Polo Mejia, Marie-Christine Anselmet, Christian Artigues, and Pierre Lopez. 2017. A new RCPSP variant for scheduling research activities in a nuclear laboratory. In Proceedings of the 47th International Conference on Computers & Industrial Engineering (CIE47). https:\/\/hal.laas.fr\/hal-01630977."},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00153-8"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.16.1.93"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1002\/sres.2743"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s002910000042"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58942-4_28"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.037"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3546871","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3546871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:41Z","timestamp":1750186841000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3546871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,28]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2,28]]}},"alternative-id":["10.1145\/3546871"],"URL":"https:\/\/doi.org\/10.1145\/3546871","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,28]]},"assertion":[{"value":"2021-05-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-07","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}