{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:08:35Z","timestamp":1742944115713,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030782290"},{"type":"electronic","value":"9783030782306"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78230-6_23","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T23:06:15Z","timestamp":1623884775000},"page":"365-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Short-Term Scheduling of Production Fleets in Underground Mines Using CP-Based LNS"],"prefix":"10.1007","author":[{"given":"Max","family":"\u00c5strand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Johansson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid Reza","family":"Feyzmahdavian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"1\u20133","key":"23_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, \u00d6., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1\u20133), 75\u2013102 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"12","key":"23_CR2","first-page":"1265","volume":"118","author":"M \u00c5strand","year":"2018","unstructured":"\u00c5strand, M., Johansson, M., Greberg, J.: Underground mine scheduling modeled as a flow shop - a review of relevant works and future challenges. J. Southern Afr. Inst. Min. Metall. 118(12), 1265\u20131276 (2018)","journal-title":"J. Southern Afr. Inst. Min. Metall."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-319-93031-2_44","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M \u00c5strand","year":"2018","unstructured":"\u00c5strand, M., Johansson, M., Zanarini, A.: Fleet scheduling in underground mines using constraint programming. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 605\u2013613. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_44"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"105036","DOI":"10.1016\/j.cor.2020.105036","volume":"123","author":"M \u00c5strand","year":"2020","unstructured":"\u00c5strand, M., Johansson, M., Zanarini, A.: Underground mine scheduling of mobile machines using constraint programming and large neighborhood search. Comput. Oper. Res. 123, 105036 (2020)","journal-title":"Comput. Oper. Res."},{"key":"23_CR5","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms","author":"T Back","year":"1996","unstructured":"Back, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, Oxford (1996)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Behrens, J.K., Lange, R., Mansouri, M.: A constraint programming approach to simultaneous task allocation and motion scheduling for industrial dual-arm manipulation tasks. In: 2019 International Conference on Robotics and Automation (ICRA), pp. 8705\u20138711. IEEE (2019)","DOI":"10.1109\/ICRA.2019.8794022"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-319-44953-1_34","volume-title":"Principles and Practice of Constraint Programming","author":"KEC Booth","year":"2016","unstructured":"Booth, K.E.C., Nejat, G., Beck, J.C.: A constraint programming approach to multi-robot task allocation and scheduling in retirement homes. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 539\u2013555. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_34"},{"key":"23_CR8","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, vol. 16, p. 146 (2004)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10852-008-9100-2","volume":"8","author":"T Carchrae","year":"2009","unstructured":"Carchrae, T., Beck, J.C.: Principles for the design of large neighborhood search. J. Math. Modell. Algorithms 8, 245\u2013270 (2009)","journal-title":"J. Math. Modell. Algorithms"},{"key":"23_CR10","unstructured":"Darling, P.: SME Mining Engineering Handbook, vol. 1. SME (2011)"},{"key":"23_CR11","unstructured":"Gecode Team: Gecode: Generic constraint development environment (2019). https:\/\/www.gecode.org"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/ijoc.2014.0625","volume":"27","author":"D Grimes","year":"2015","unstructured":"Grimes, D., Hebrard, E.: Solving variants of the job shop scheduling problem through conflict-directed search. INFORMS J. Comput. 27(2), 268\u2013284 (2015)","journal-title":"INFORMS J. Comput."},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-04244-7_33","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"D Grimes","year":"2009","unstructured":"Grimes, D., Hebrard, E., Malapert, A.: Closing the open shop: contradicting conventional wisdom. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 400\u2013408. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_33"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2018.03.025","volume":"91","author":"AM Ham","year":"2018","unstructured":"Ham, A.M.: Integrated scheduling of m-truck, m-drone, and m-depot constrainedby time-window, drop-pickup, and m-visit using constraint programming. Transp. Res. Part C: Emerg. Technol. 91, 1\u201314 (2018)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"issue":"4","key":"23_CR15","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s10845-019-01518-4","volume":"31","author":"L He","year":"2019","unstructured":"He, L., de Weerdt, M., Yorke-Smith, N.: Time\/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm. J. Intell. Manuf. 31(4), 1051\u20131078 (2019). https:\/\/doi.org\/10.1007\/s10845-019-01518-4","journal-title":"J. Intell. Manuf."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-319-93031-2_29","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"P Laborie","year":"2018","unstructured":"Laborie, P.: An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 403\u2013411. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_29"},{"key":"23_CR17","unstructured":"Laborie, P., Godard, D.: Self-adapting large neighborhood search: application to single-mode scheduling problems. Proceedings MISTA-07, Paris 8 (2007)"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Inf. Process. Lett. 47(4), 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Mears, C., De\u00a0La\u00a0Banda, M.G., Demoen, B., Wallace, M.: Lightweight dynamic symmetry breaking. Constraints 19(3), 195\u2013242 (2014)","DOI":"10.1007\/s10601-013-9154-2"},{"key":"23_CR20","series-title":"Springer Series in Geomechanics and Geoengineering","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-030-33954-8_18","volume-title":"Proceedings of the 28th International Symposium on Mine Planning and Equipment Selection - MPES 2019","author":"K Mishchenko","year":"2020","unstructured":"Mishchenko, K., \u00c5strand, M., Molander, M., Lindkvist, R., Viklund, T.: Developing a tool for automatic mine scheduling. In: Topal, E. (ed.) MPES 2019. SSGG, pp. 146\u2013153. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-33954-8_18"},{"key":"23_CR21","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Courier Corporation (1998)"},{"issue":"8","key":"23_CR22","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"23_CR23","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00291-015-0414-y","volume":"38","author":"M Schulze","year":"2015","unstructured":"Schulze, M., Rieck, J., Seifi, C., Zimmermann, J.: Machine scheduling in underground mining: an application in the potash industry. OR Spectrum 38(2), 365\u2013403 (2015). https:\/\/doi.org\/10.1007\/s00291-015-0414-y","journal-title":"OR Spectrum"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Schulze, M., Zimmermann, J.: Staff and machine shift scheduling in a German potash mine. J. Scheduling 1\u201322 (2017)","DOI":"10.1007\/s10951-017-0527-z"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Seifi, C., Schulze, M., Zimmermann, J.: A two-stage solution approach for a shift scheduling problem with a simultaneous assignment of machines and workers. In: The 39th International Symposium on Application of Computers and Operations Research in the Mineral Industry, Wroclaw, Poland (2019)","DOI":"10.1201\/9780429320774-43"},{"key":"23_CR27","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2020.10.007","volume":"292","author":"C Seifi","year":"2020","unstructured":"Seifi, C., Schulze, M., Zimmermann, J.: A new mathematical formulation for apotash-mine shift scheduling problem with a simultaneous assignment of machines and workers. Eur. J. Oper. Res. 292, 27\u201342 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-45406-3_6","volume-title":"Constraints in Computational Logics","author":"H Simonis","year":"2001","unstructured":"Simonis, H.: Building industrial applications with constraint programming. In: Goos, G., Hartmanis, J., van Leeuwen, J., Comon, H., March\u00e9, C., Treinen, R. (eds.) CCL 1999. LNCS, vol. 2002, pp. 271\u2013309. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45406-3_6"},{"issue":"6","key":"23_CR30","doi-asserted-by":"publisher","first-page":"e0131003","DOI":"10.1371\/journal.pone.0131003","volume":"10","author":"Z Song","year":"2015","unstructured":"Song, Z., Schunnesson, H., Rinne, M., Sturgul, J.: Intelligent scheduling for underground mobile mining equipment. PloS One 10(6), e0131003 (2015)","journal-title":"PloS One"},{"issue":"2","key":"23_CR31","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2017.06.056","volume":"264","author":"I \u017dulj","year":"2018","unstructured":"\u017dulj, I., Kramer, S., Schneider, M.: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 264(2), 653\u2013664 (2018)","journal-title":"Eur. J. Oper. Res."}],"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-030-78230-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T23:17:59Z","timestamp":1623885479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78230-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030782290","9783030782306"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78230-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2021.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":"75","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":"30","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":"0","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":"40% - 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","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":"6","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)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}