{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:44:03Z","timestamp":1757450643949,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_20","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"304-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Geibinger","sequence":"first","affiliation":[]},{"given":"Florian","family":"Mischek","sequence":"additional","affiliation":[]},{"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.ejor.2007.11.010","volume":"193","author":"JH Bartels","year":"2009","unstructured":"Bartels, J.H., Zimmermann, J.: Scheduling tests in automotive R&D projects. Eur. J. Oper. Res. 193(3), 805\u2013819 (2009). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2007.11.010","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR2","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). \n                    https:\/\/doi.org\/10.1007\/11593577_14"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3\u201341 (1999). \n                    https:\/\/doi.org\/10.1016\/S0377-2217(98)00204-5","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR4","unstructured":"Chu, G.: Improving combinatorial optimization. Ph.D. thesis, University of Melbourne, Australia (2011). \n                    http:\/\/hdl.handle.net\/11343\/36679"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0377-2217(97)00341-X","volume":"107","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1998","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Roux, W., Lasserre, J.: Multi-resource shop scheduling with resource flexibility. Eur. J. Oper. Res. 107(2), 289\u2013305 (1998). \n                    https:\/\/doi.org\/10.1016\/S0377-2217(97)00341-X","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ijpe.2006.08.021","volume":"112","author":"LE Drezet","year":"2008","unstructured":"Drezet, L.E., Billaut, J.C.: A project scheduling problem with labour constraints and time-dependent activities requirements. Int. J. Prod. Econ. 112(1), 217\u2013225 (2008). \n                    https:\/\/doi.org\/10.1016\/j.ijpe.2006.08.021\n                    \n                  . Special Section on Recent Developments in the Design, Control, Planning and Scheduling of Productive Systems","journal-title":"Int. J. Prod. Econ."},{"key":"20_CR7","volume-title":"Activity Networks: Project Planning and Control by Network Models","author":"SE Elmaghraby","year":"1977","unstructured":"Elmaghraby, S.E.: Activity Networks: Project Planning and Control by Network Models. Wiley, New York (1977)"},{"key":"20_CR8","unstructured":"Feydy, T., Goldwaser, A., Schutt, A., Stuckey, P.J., Young, K.D.: Priority search with MiniZinc. In: ModRef 2017: The Sixteenth International Workshop on Constraint Modelling and Reformulation at CP 2017 (2017)"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207(1), 1\u201314 (2010). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2009.11.005","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR10","unstructured":"IBM, CPLEX: 12.8.0 IBM ILOG CPLEX optimization studio CP optimizer user\u2019s manual (2017). \n                    https:\/\/www.ibm.com\/analytics\/cplex-cp-optimizer"},{"key":"20_CR11","unstructured":"IBM, CPLEX: 12.8.0 IBM ILOG CPLEX optimization studio CPLEX user\u2019s manual (2017). \n                    https:\/\/www.ibm.com\/analytics\/cplex-optimizer"},{"key":"20_CR12","series-title":"International Handbooks on Information Systems","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-319-05443-8_21","volume-title":"Handbook on Project Management and Scheduling","author":"M Mika","year":"2015","unstructured":"Mika, M., Walig\u00f3ra, G., W\u0229glarz, J.: Overview and state of the art. In: Schwindt, C., Zimmermann, J. (eds.) Handbook on Project Management and Scheduling. International Handbooks on Information Systems, vol. 1, pp. 445\u2013490. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-05443-8_21"},{"key":"20_CR13","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)"},{"key":"20_CR14","unstructured":"Mischek, F., Musliu, N.: 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 (2018)"},{"key":"20_CR15","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). \n                    https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0360-8352(96)00212-4","volume":"32","author":"N Nudtasomboon","year":"1997","unstructured":"Nudtasomboon, N., Randhawa, S.U.: Resource-constrained project scheduling with renewable and non-renewable resources and time-resource tradeoffs. Comput. Ind. Eng. 32(1), 227\u2013242 (1997). \n                    https:\/\/doi.org\/10.1016\/S0360-8352(96)00212-4","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"AAB Pritsker","year":"1969","unstructured":"Pritsker, A.A.B., Waiters, L.J., Wolfe, P.M.: Multiproject scheduling with limited resources: a zero-one programming approach. Manage. Sci. 16(1), 93\u2013108 (1969). \n                    https:\/\/doi.org\/10.1287\/mnsc.16.1.93","journal-title":"Manage. Sci."},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0377-2217(96)00219-6","volume":"102","author":"F Salewski","year":"1997","unstructured":"Salewski, F., Schirmer, A., Drexl, A.: Project scheduling under resource and mode identity constraints: model, complexity, methods, and application. Eur. J. Oper. Res. 102(1), 88\u2013110 (1997). \n                    https:\/\/doi.org\/10.1016\/S0377-2217(96)00219-6","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR19","unstructured":"Schulte, C., Lagerkvist, M., Tack, G.: Gecode 6.10 reference documentation (2018). \n                    https:\/\/www.gecode.org"},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s002910000042","volume":"22","author":"C Schwindt","year":"2000","unstructured":"Schwindt, C., Trautmann, N.: Batch scheduling in process industries: an application of resource-constrained project scheduling. OR-Spektrum 22(4), 501\u2013524 (2000)","journal-title":"OR-Spektrum"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-319-44953-1_31","volume-title":"Principles and Practice of Constraint Programming","author":"R Szeredi","year":"2016","unstructured":"Szeredi, R., Schutt, A.: Modelling and solving multi-mode resource-constrained project scheduling. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 483\u2013492. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-44953-1_31"},{"issue":"3","key":"20_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2010.03.037","volume":"208","author":"J W\u0229glarz","year":"2011","unstructured":"W\u0229glarz, J., J\u00f3zefowska, J., Mika, M., Walig\u00f3ra, G.: Project scheduling with finite or infinite number of activity processing modes\u2013a survey. Eur. J. Oper. Re. 208(3), 177\u2013205 (2011). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2010.03.037","journal-title":"Eur. J. Oper. Re."},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-66158-2_20","volume-title":"Principles and Practice of Constraint Programming","author":"KD Young","year":"2017","unstructured":"Young, K.D., Feydy, T., Schutt, A.: Constraint programming applied to the multi-skill project scheduling problem. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 308\u2013317. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66158-2_20"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:11:11Z","timestamp":1558984271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}