{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T13:10:09Z","timestamp":1751289009438,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959721","type":"print"},{"value":"9783031959738","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-95973-8_12","type":"book-chapter","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:55:47Z","timestamp":1751284547000},"page":"188-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modeling and\u00a0Solving the\u00a0Generalized Test Laboratory Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2209-1516","authenticated-orcid":false,"given":"Philipp","family":"Danzinger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0856-7162","authenticated-orcid":false,"given":"Tobias","family":"Geibinger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1166-3881","authenticated-orcid":false,"given":"Florian","family":"Mischek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3992-8637","authenticated-orcid":false,"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11593577_14","volume-title":"Practice and Theory of Automated Timetabling V","author":"O Bellenguez","year":"2005","unstructured":"Bellenguez, O., N\u00e9ron, E.: Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills. In: Burke, E., Trick, M. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 229\u2013243. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593577_14"},{"key":"12_CR2","unstructured":"Chu, G.: Improving combinatorial optimization. Ph.D. thesis, University of Melbourne, Australia (2011). http:\/\/hdl.handle.net\/11343\/36679"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Danzinger, P., Geibinger, T., Janneau, D., Mischek, F., Musliu, N., Poschalko, C.: A system for automated industrial test laboratory scheduling. ACM Trans. Intell. Syst. Technol. 14(1) (2023). https:\/\/doi.org\/10.1145\/3546871","DOI":"10.1145\/3546871"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Danzinger, P., Geibinger, T., Mischek, F., Musliu, N.: Solving the test laboratory scheduling problem with variable task grouping. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 30, no. 1, pp. 357\u2013365 (2020). https:\/\/doi.org\/10.1609\/icaps.v30i1.6681","DOI":"10.1609\/icaps.v30i1.6681"},{"key":"12_CR5","unstructured":"Elmaghraby, S.E.: Activity networks: project planning and control by network models (1977). https:\/\/api.semanticscholar.org\/CorpusID:60546726"},{"key":"12_CR6","unstructured":"Mischek, F., Musliu, N.: A local search framework for industrial test laboratory scheduling. In: Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2018), Vienna, Austria, 28\u201331 August 2018, pp. 465\u2013467 (2018)"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/S10479-021-04007-1","volume":"302","author":"F Mischek","year":"2021","unstructured":"Mischek, F., Musliu, N.: A local search framework for industrial test laboratory scheduling. Ann. Oper. Res. 302(2), 533\u2013562 (2021). https:\/\/doi.org\/10.1007\/S10479-021-04007-1","journal-title":"Ann. Oper. Res."},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Mischek, F., Musliu, N.: Leveraging problem-independent hyper-heuristics for real-world test laboratory scheduling. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201923, pp. 321\u2013329. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3583131.3590354","DOI":"10.1145\/3583131.3590354"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Mischek, F., Musliu, N., Schaerf, A.: Local search approaches for the test laboratory scheduling problem with variable task grouping. J. Schedul. 26(5), 457\u2013477 (2023). https:\/\/doi.org\/10.1007\/s10951-021-00699-. https:\/\/ideas.repec.org\/a\/spr\/jsched\/v26y2023i5d10.1007_s10951-021-00699-2.html","DOI":"10.1007\/s10951-021-00699-"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228\u2013249 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10951-014-0402-0","volume":"19","author":"T Wauters","year":"2014","unstructured":"Wauters, T., Kinable, J., Smet, P., Vancroonenburg, W., Vanden Berghe, G., Verstichel, J.: The multi-mode resource-constrained multi-project scheduling problem. J. Sched. 19(3), 271\u2013283 (2014). https:\/\/doi.org\/10.1007\/s10951-014-0402-0","journal-title":"J. Sched."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95973-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:33:56Z","timestamp":1751286836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95973-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959721","9783031959738"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95973-8_12","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":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"10 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}