{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:07:44Z","timestamp":1743052064896,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332708"},{"type":"electronic","value":"9783031332715"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33271-5_31","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"477-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Iterated Greedy Constraint Programming for\u00a0Scheduling Steelmaking Continuous Casting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3029-6968","authenticated-orcid":false,"given":"Dongyun","family":"Kim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6213-8900","authenticated-orcid":false,"given":"Yeonjun","family":"Choi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1192-8854","authenticated-orcid":false,"given":"Kyungduk","family":"Moon","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1499-9367","authenticated-orcid":false,"given":"Myungho","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3526-9865","authenticated-orcid":false,"given":"Kangbok","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7814-0642","authenticated-orcid":false,"given":"Michael L.","family":"Pinedo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Abderrazzak, S., Hamid, A., Omar, S.: Adaptive large neighborhood search for the just-in-time job-shop scheduling problem. In: 2022 International Conference on Control, Automation and Diagnosis (ICCAD), pp. 1\u20136 (2022)","DOI":"10.1109\/ICCAD55197.2022.9853973"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.1100.0388","volume":"23","author":"JC Beck","year":"2011","unstructured":"Beck, J.C., Feng, T., Watson, J.P.: Combining constraint programming and local search for job-shop scheduling. INFORMS J. Comput. 23(1), 1\u201314 (2011)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"31_CR3","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. Model. Algorithms 8(3), 245\u2013270 (2009)","journal-title":"J. Math. Model. Algorithms"},{"key":"31_CR4","doi-asserted-by":"publisher","unstructured":"Hong, J.: junetech\/scc-process-scheduling-instances: 2021-07-23 version (2021). https:\/\/doi.org\/10.5281\/zenodo.5126007","DOI":"10.5281\/zenodo.5126007"},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1080\/00207543.2021.1975839","volume":"60","author":"J Hong","year":"2022","unstructured":"Hong, J., Moon, K., Lee, K., Lee, K., Pinedo, M.L.: An iterated greedy matheuristic for scheduling in steelmaking-continuous casting process. Int. J. Prod. Res. 60(2), 623\u2013643 (2022)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.1100.0446","volume":"24","author":"A Malapert","year":"2012","unstructured":"Malapert, A., Cambazard, H., Gu\u00e9ret, C., Jussien, N., Langevin, A., Rousseau, L.M.: An optimal constraint programming approach to the open-shop problem. INFORMS J. Comput. 24(2), 228\u2013244 (2012)","journal-title":"INFORMS J. Comput."},{"key":"31_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101058","volume":"71","author":"L Meng","year":"2022","unstructured":"Meng, L., Gao, K., Ren, Y., Zhang, B., Sang, H., Chaoyong, Z.: Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 71, 101058 (2022)","journal-title":"Swarm Evol. Comput."},{"key":"31_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106347","volume":"142","author":"L Meng","year":"2020","unstructured":"Meng, L., Zhang, C., Ren, Y., Zhang, B., Lv, C.: Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput. Ind. Eng. 142, 106347 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Missbauer, H., Hauber, W., Stadler, W.: A scheduling system for the steelmaking-continuous casting process. A case study from the steel-making industry. Int. J. Prod. Res. 47(15), 4147\u20134172 (2009)","DOI":"10.1080\/00207540801950136"},{"key":"31_CR10","unstructured":"Pacino, D., Van Hentenryck, P.: Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume Three, Barcelona, Catalonia, Spain, pp. 1997\u20132002. AAAI Press (2011)"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"QK Pan","year":"2013","unstructured":"Pan, Q.K., Wang, L., Mao, K., Zhao, J., Zhang, M.: An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process. IEEE Trans. Autom. Sci. Eng. 10(2), 307\u2013322 (2013)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 399\u2013419. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13"},{"key":"31_CR13","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"},{"issue":"1","key":"31_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/00207540110073000","volume":"40","author":"L Tang","year":"2002","unstructured":"Tang, L., Luh, P.B., Liu, J., Fang, L.: Steel-making process scheduling using Lagrangian relaxation. Int. J. Prod. Res. 40(1), 55\u201370 (2002)","journal-title":"Int. J. Prod. 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-031-33271-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:08:07Z","timestamp":1684775287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 May 2023","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":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","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":"71","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":"26","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":"6","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":"37% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}