{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:41:33Z","timestamp":1743057693782,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_22","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"334-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Leveraging Constraint Scheduling: A Case Study to the Textile Industry"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Mercier-Aubin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Gaudreault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Chakrabortty, R.K., Sarker, R.A., Essam, D.L.: Resource constrained project scheduling with uncertain activity durations. Comput. Ind. Eng. 112, 537\u2013550 (2017). https:\/\/doi.org\/10.1016\/j.cie.2016.12.040 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835216305186","key":"22_CR1","DOI":"10.1016\/j.cie.2016.12.040"},{"unstructured":"Chu, G., Stuckey, P.J., Schutt, A., Ehlers, T., Gange, G., Francis, K.: Chuffed, a lazy clause generation solver (2018)","key":"22_CR2"},{"key":"22_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"W Cook","year":"2011","unstructured":"Cook, W.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2011)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"2799","DOI":"10.1007\/s00170-013-5221-5","volume":"69","author":"A Costa","year":"2013","unstructured":"Costa, A., Cappadonna, F.A., Fichera, S.: A hybrid genetic algorithm for job sequencing and worker allocation in parallel unrelated machines with sequence-dependent setup times. Int. J. Adv. Manuf. Technol. 69, 2799\u20132817 (2013). https:\/\/doi.org\/10.1007\/s00170-013-5221-5","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/978-3-540-45193-8_59","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"E Danna","year":"2003","unstructured":"Danna, E., Perron, L.: Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness costs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 817\u2013821. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_59"},{"unstructured":"Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, pp. 92\u2013101 (2000)","key":"22_CR6"},{"doi-asserted-by":"crossref","unstructured":"Hermann, M., Pentek, T., Otto, B.: Design principles for Industrie 4.0 scenarios. In: 49th Hawaii International Conference on System Sciences (HICSS), pp. 3928\u20133937 (2016)","key":"22_CR7","DOI":"10.1109\/HICSS.2016.488"},{"doi-asserted-by":"crossref","unstructured":"Kagermann, H., Helbig, J., Hellinger, A., Wahlster, W.: Recommendations for implementing the strategic initiative Industrie 4.0: securing the future of German manufacturing industry; final report of the Industrie 4.0 working group. Technical report, Forschungsunion (2013)","key":"22_CR8","DOI":"10.3390\/sci4030026"},{"unstructured":"Kajg\u00e5rd, E.: Route optimisation for winter road maintenance using constraint modelling (2015)","key":"22_CR9"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"JL Lauriere","year":"1978","unstructured":"Lauriere, J.L.: A language and a program for stating and solving combinatorial problems. Artif. Intell. 10(1), 29\u2013127 (1978)","journal-title":"Artif. Intell."},{"issue":"9","key":"22_CR11","doi-asserted-by":"publisher","first-page":"3806","DOI":"10.1016\/j.asoc.2013.05.009","volume":"13","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2013","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Blum, C., Ohlmann, J.W., Thomas, B.W.: The travelling salesman problem with time windows: adapting algorithms from travel-time to makespan optimization. Appl. Soft Comput. 13(9), 3806\u20133815 (2013)","journal-title":"Appl. Soft Comput."},{"key":"22_CR12","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":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0377-2217(83)90099-1","volume":"13","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis, H.N.: k-interchange procedures for local search in a precedence-constrained routing problem. Eur. J. Oper. Res. 13(4), 391\u2013402 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"MWP Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.P.: Local search in routing problems with time windows. Ann. Oper. Res. 4(1), 285\u2013305 (1985). https:\/\/doi.org\/10.1007\/BF02022044","journal-title":"Ann. Oper. Res."},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1007\/978-3-642-04244-7_58","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"A Schutt","year":"2009","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Why cumulative decomposition is not as bad as it sounds. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 746\u2013761. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_58"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-44953-1_29","volume-title":"Principles and Practice of Constraint Programming","author":"M Shishmarev","year":"2016","unstructured":"Shishmarev, M., Mears, C., Tack, G., Garcia de la Banda, M.: Learning from learning solvers. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 455\u2013472. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_29"},{"unstructured":"Tran, T.T., Beck, J.C.: Logic-based benders decomposition for alternative resource scheduling with sequence dependent setups. In: Proceedings of the 20th European Conference on Artificial Intelligence ECAI 2012, pp. 774\u2013779 (2012)","key":"22_CR17"}],"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-58942-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:58:01Z","timestamp":1668819481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - 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 (provided by the conference organizers)"}},{"value":"3.08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}