{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T03:54:20Z","timestamp":1778558060324,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["61104004"],"award-info":[{"award-number":["61104004"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s00521-023-08973-4","type":"journal-article","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T19:02:26Z","timestamp":1695409346000},"page":"2131-2140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A novel method with constraints embedded into a cuckoo search for steelmaking\u2013continuous casting scheduling"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3429-5340","authenticated-orcid":false,"given":"Haihong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hui","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Zhikao","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Tongtong","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Yue","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Xiuying","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"8973_CR1","first-page":"1702","volume":"42","author":"X-Y Wang","year":"2016","unstructured":"Wang X-Y, Feng H, Ren Z-K, Zhou Y-P (2016) Two-stage optimal modelling and algorithm of production scheduling for steelmaking and continuous casting. Acta Autom Sin 42:1702\u20131710","journal-title":"Acta Autom Sin"},{"key":"8973_CR2","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 et al (2022) An iterated greedy matheuristic for scheduling in steelmaking-continuous casting process. Int J Prod Res 60:623\u2013643","journal-title":"Int J Prod Res"},{"key":"8973_CR3","doi-asserted-by":"publisher","first-page":"106271","DOI":"10.1016\/j.cie.2020.106271","volume":"140","author":"H Cui","year":"2020","unstructured":"Cui H, Luo X, Wang Y (2020) Scheduling of steelmaking-continuous casting process using deflected surrogate Lagrangian relaxation approach and DC algorithm. Comput Ind Eng 140:106271","journal-title":"Comput Ind Eng"},{"key":"8973_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.compchemeng.2017.05.026","volume":"106","author":"H Cui","year":"2017","unstructured":"Cui H, Luo X (2017) An improved lagrangian relaxation approach to scheduling steelmaking\u2013continuous casting process. Comput Chem Eng 106:133\u2013146","journal-title":"Comput Chem Eng"},{"key":"8973_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.cherd.2021.01.035","volume":"168","author":"D Han","year":"2021","unstructured":"Han D, Tang Q, Zhang Z et al (2021) An efficient augmented lagrange multiplier method for steelmaking and continuous casting production scheduling. Chem Eng Res Des 168:169\u2013192","journal-title":"Chem Eng Res Des"},{"key":"8973_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10479-021-04217-7","volume":"310","author":"R Pan","year":"2022","unstructured":"Pan R, Wang Q, Li Z et al (2022) Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs. Ann Oper Res 310:119\u2013151","journal-title":"Ann Oper Res"},{"key":"8973_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"QK Pan","year":"2013","unstructured":"Pan QK, Wang L, Mao K et al (2013) An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process. IEEE Trans Autom Sci Eng 10:307\u2013322","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"8973_CR8","doi-asserted-by":"crossref","unstructured":"Feng H, Wang X (2016) A novel schedule method for steelmaking and continuous casting base on cuckoo search algorithm. In: 2016 5th International conference on computer science and network technology (ICCSNT). IEEE, pp 45\u201349","DOI":"10.1109\/ICCSNT.2016.8069376"},{"key":"8973_CR9","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.ejor.2015.10.007","volume":"250","author":"QK Pan","year":"2016","unstructured":"Pan QK (2016) An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling. Eur J Oper Res 250:702\u2013714","journal-title":"Eur J Oper Res"},{"key":"8973_CR10","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.2355\/isijinternational.ISIJINT-2019-423","volume":"60","author":"J Yang","year":"2020","unstructured":"Yang J, Wang B, Liu Q et al (2020) Scheduling model for the practical steelmaking-continuous casting production and heuristic algorithm based on the optimization of \u201cfurnace-caster matching\u201d mode. ISIJ Int 60:1213\u20131224","journal-title":"ISIJ Int"},{"key":"8973_CR11","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1109\/TSMC.2016.2604081","volume":"46","author":"S Yu","year":"2016","unstructured":"Yu S, Chai T, Tang Y (2016) An effective heuristic rescheduling method for steelmaking and continuous casting production process with multirefining modes. IEEE Trans Syst Man Cybern Syst 46:1675\u20131688","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"8973_CR12","first-page":"1","volume":"2020","author":"S Wang","year":"2020","unstructured":"Wang S, Shi Y, Liu S (2020) Integrated scheduling for steelmaking continuous casting\u2014hot rolling processes considering hot chain logistics. Math Probl Eng 2020:1\u201310","journal-title":"Math Probl Eng"},{"key":"8973_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s40815-017-0331-0","volume":"20","author":"M Fazel Zarandi","year":"2018","unstructured":"Fazel Zarandi M, Dorry F (2018) A hybrid fuzzy PSO algorithm for solving steelmaking\u2013continuous casting scheduling problem. Int J Fuzzy Syst 20:219\u2013235","journal-title":"Int J Fuzzy Syst"},{"key":"8973_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0377-2217(99)00041-7","volume":"120","author":"L Tang","year":"2000","unstructured":"Tang L, Liu J, Rong A, Yang Z (2000) A mathematical programming model for scheduling steelmaking-continuous casting production. Eur J Oper Res 120:423\u2013435","journal-title":"Eur J Oper Res"},{"key":"8973_CR15","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.ijpe.2004.10.016","volume":"104","author":"A Bellabdaoui","year":"2006","unstructured":"Bellabdaoui A, Teghem J (2006) A mixed-integer linear programming model for the continuous casting planning. Int J Prod Econ 104:260\u2013270","journal-title":"Int J Prod Econ"},{"key":"8973_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1006-706X(13)60118-1","volume":"20","author":"YY Tan","year":"2013","unstructured":"Tan YY, Huang YL et al (2013) Two-stage mathematical programming approach for steelmaking process scheduling under variable electricity price. J Iron Steel Res Int 20:1\u20138. https:\/\/doi.org\/10.1016\/S1006-706X(13)60118-1","journal-title":"J Iron Steel Res Int"},{"key":"8973_CR17","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1080\/00207540500434713","volume":"44","author":"V Kumar","year":"2006","unstructured":"Kumar V, Kumar S, Tiwari MK, Chan FTS (2006) Auction-based approach to resolve the scheduling problem in the steel making process. Int J Prod Res 44:1503\u20131522","journal-title":"Int J Prod Res"},{"key":"8973_CR18","doi-asserted-by":"publisher","first-page":"2450","DOI":"10.1016\/j.cor.2008.10.010","volume":"36","author":"A Atighehchian","year":"2009","unstructured":"Atighehchian A, Bijari M, Tarkesh H (2009) A novel hybrid algorithm for scheduling steel-making continuous casting production. Comput Oper Res 36:2450\u20132461","journal-title":"Comput Oper Res"},{"key":"8973_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.compchemeng.2014.02.028","volume":"66","author":"Y Yun","year":"2014","unstructured":"Yun Y, Jie L, Li Z et al (2014) Robust optimization and stochastic programming approaches for medium-term production scheduling of a large-scale steelmaking continuous casting process under demand uncertainty. Comput Chem Eng 66:165\u2013185","journal-title":"Comput Chem Eng"},{"key":"8973_CR20","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.cie.2015.06.002","volume":"87","author":"S Jiang","year":"2015","unstructured":"Jiang S, Min L, Hao J, Qian W (2015) A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry. Comput Ind Eng 87:518\u2013531","journal-title":"Comput Ind Eng"},{"key":"8973_CR21","first-page":"2","volume":"23","author":"P De Moerloose","year":"2023","unstructured":"De Moerloose P, Maenhout B (2023) A two-stage local search heuristic for solving the steelmaking continuous casting scheduling problem with dual shared-resource and blocking constraints. Oper Res 23:2","journal-title":"Oper Res"},{"key":"8973_CR22","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.asoc.2017.07.016","volume":"60","author":"S Jiang","year":"2017","unstructured":"Jiang S, Zheng Z, Liu M (2017) A multi-stage dynamic soft scheduling algorithm for the uncertain steelmaking-continuous casting scheduling problem. Appl Soft Comput 60:722\u2013736. https:\/\/doi.org\/10.1016\/j.asoc.2017.07.016","journal-title":"Appl Soft Comput"},{"key":"8973_CR23","doi-asserted-by":"crossref","unstructured":"Sun L, Luan F, Ying Y, Mao K (2017) Rescheduling optimization of steelmaking-continuous casting process based on the lagrangian heuristic algorithm. J Ind Manag Optim 13:","DOI":"10.3934\/jimo.2016081"},{"key":"8973_CR24","first-page":"9","volume":"19","author":"YU Sheng-ping","year":"2012","unstructured":"Sheng-ping YU et al (2012) A rescheduling method for operation time delay disturbance in steelmaking and continuous casting production process\u2014sciencedirect. J Iron Steel Res Int 19:9","journal-title":"J Iron Steel Res Int"},{"key":"8973_CR25","first-page":"1041","volume":"26","author":"X Hu","year":"2013","unstructured":"Hu X, Yin Y (2013) Cooperative co-evolutionary cuckoo search algorithm for continuous function optimization problems. Pattern Recognit Artif Intell 26:1041\u20131049","journal-title":"Pattern Recognit Artif Intell"},{"key":"8973_CR26","doi-asserted-by":"publisher","first-page":"5322","DOI":"10.3390\/app13095322","volume":"13","author":"K Jawad","year":"2023","unstructured":"Jawad K, Mahto R, Das A et al (2023) Novel cuckoo search-based metaheuristic approach for deep learning prediction of depression. Appl Sci 13:5322","journal-title":"Appl Sci"},{"key":"8973_CR27","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1007\/s00477-022-02361-5","volume":"37","author":"RMA Ikram","year":"2023","unstructured":"Ikram RMA, Dehrashid AA, Zhang B et al (2023) A novel swarm intelligence: cuckoo optimization algorithm (COA) and SailFish optimizer (SFO) in landslide susceptibility assessment. Stoch Environ Res Risk Assess 37:1717\u20131743","journal-title":"Stoch Environ Res Risk Assess"},{"key":"8973_CR28","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s00521-018-3928-9","volume":"32","author":"HR Boveiri","year":"2020","unstructured":"Boveiri HR, Elhoseny M (2020) A-COA: an adaptive cuckoo optimization algorithm for continuous and combinatorial optimization. Neural Comput Appl 32:681\u2013705","journal-title":"Neural Comput Appl"},{"key":"8973_CR29","doi-asserted-by":"crossref","unstructured":"Alkhateeb F, Abed-alguni BH, Al-rousan MH (2022) Discrete hybrid cuckoo search and simulated annealing algorithm for solving the job shop scheduling problem. J Supercomput 1\u201328","DOI":"10.1007\/s11227-021-04050-6"},{"key":"8973_CR30","doi-asserted-by":"crossref","unstructured":"Lin C, Cao Z, Zhou M (2022) Learning-based cuckoo search algorithm to schedule a flexible job shop with sequencing flexibility. IEEE Transactions of Cybernetics","DOI":"10.1109\/TCYB.2022.3210228"},{"key":"8973_CR31","doi-asserted-by":"publisher","first-page":"4732","DOI":"10.1080\/00207543.2013.767988","volume":"51","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013) A hybrid cuckoo search via L\u00e9vy flights for the permutation flow shop scheduling problem. Int J Prod Res 51:4732\u20134754","journal-title":"Int J Prod Res"},{"key":"8973_CR32","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1007\/s00170-012-4061-z","volume":"64","author":"S Burnwal","year":"2013","unstructured":"Burnwal S, Deb S (2013) Scheduling optimization of flexible manufacturing system using cuckoo search-based approach. Int J Adv Manuf Technol 64:951\u2013959","journal-title":"Int J Adv Manuf Technol"},{"key":"8973_CR33","doi-asserted-by":"publisher","first-page":"108921","DOI":"10.1016\/j.cie.2022.108921","volume":"176","author":"X Li","year":"2023","unstructured":"Li X, Guo X, Tang H et al (2023) An improved cuckoo search algorithm for the hybrid flow-shop scheduling problem in sand casting enterprises considering batch processing. Comput Ind Eng 176:108921","journal-title":"Comput Ind Eng"},{"key":"8973_CR34","doi-asserted-by":"crossref","unstructured":"Laha D, Behera DK (2014) An improved cuckoo search algorithm for parallel machine scheduling. In: International conference on swarm, evolutionary, and memetic computing. Springer, pp 788\u2013800","DOI":"10.1007\/978-3-319-20294-5_67"},{"key":"8973_CR35","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.asoc.2018.04.047","volume":"69","author":"K Bibiks","year":"2018","unstructured":"Bibiks K, Hu Y-F, Li J-P et al (2018) Improved discrete cuckoo search for the resource-constrained project scheduling problem. Appl Soft Comput 69:493\u2013503","journal-title":"Appl Soft Comput"},{"key":"8973_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.01.001","volume":"5","author":"K Chandrasekaran","year":"2012","unstructured":"Chandrasekaran K, Simon SP (2012) Multi-objective scheduling problem: hybrid approach using fuzzy assisted cuckoo search algorithm. Swarm Evol Comput 5:1\u201316","journal-title":"Swarm Evol Comput"},{"key":"8973_CR37","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ijepes.2014.10.004","volume":"65","author":"TT Nguyen","year":"2015","unstructured":"Nguyen TT, Vo DN (2015) Modified cuckoo search algorithm for short-term hydrothermal scheduling. Int J Electr Power Energy Syst 65:271\u2013281","journal-title":"Int J Electr Power Energy Syst"},{"key":"8973_CR38","doi-asserted-by":"publisher","first-page":"e00938","DOI":"10.1016\/j.heliyon.2018.e00938","volume":"4","author":"OI Abiodun","year":"2018","unstructured":"Abiodun OI, Jantan A, Omolara AE et al (2018) State-of-the-art in artificial neural network applications: a survey. Heliyon 4:e00938","journal-title":"Heliyon"},{"key":"8973_CR39","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.asoc.2017.02.034","volume":"61","author":"M Shehab","year":"2017","unstructured":"Shehab M, Khader AT, Al-Betar MA (2017) A survey on applications and variants of the cuckoo search algorithm. Appl Soft Comput 61:1041\u20131059","journal-title":"Appl Soft Comput"},{"key":"8973_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00521-013-1367-1","volume":"24","author":"X-S Yang","year":"2014","unstructured":"Yang X-S, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput Appl 24:169\u2013174","journal-title":"Neural Comput Appl"},{"key":"8973_CR41","doi-asserted-by":"crossref","unstructured":"Yang X-S, Deb S (2017) Cuckoo search: state-of-the-art and opportunities. In: 2017 IEEE 4th international conference on soft computing & machine intelligence (ISCMI). IEEE, pp 55\u201359","DOI":"10.1109\/ISCMI.2017.8279597"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08973-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08973-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08973-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T15:05:44Z","timestamp":1705676744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08973-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["8973"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08973-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,22]]},"assertion":[{"value":"23 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare A co-authors have seen and agree with the contents of the manuscript and there is no financial interest to report. We certify that the submission is original work and is not under review at any other publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This is to state that the authors give full permission for the publication of the article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}