{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:25:10Z","timestamp":1786980310625,"version":"build-2736575974"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T00:00:00Z","timestamp":1696636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T00:00:00Z","timestamp":1696636800000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s00521-023-09030-w","type":"journal-article","created":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T23:19:10Z","timestamp":1696634350000},"page":"599-617","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An improved hybrid ICA-SA metaheuristic for order acceptance and scheduling with time windows and sequence-dependent setup times"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5500-471X","authenticated-orcid":false,"given":"Sasan","family":"Mahmoudinazlou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arash","family":"Alizadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Noble","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sina","family":"Eslamdoust","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,7]]},"reference":[{"key":"9030_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106102","volume":"138","author":"L He","year":"2019","unstructured":"He L, Guijt A, Weerdt M, Xing L, Yorke-Smith N (2019) Order acceptance and scheduling with sequence-dependent setup times: a new memetic algorithm and benchmark of the state of the art. Comput Ind Eng 138:106102","journal-title":"Comput Ind Eng"},{"issue":"1","key":"9030_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ijpe.2010.02.002","volume":"125","author":"C Og","year":"2010","unstructured":"Og C, Salman FS, Yal\u00e7\u0131n ZB et al (2010) Order acceptance and scheduling decisions in make-to-order systems. Int J Prod Econ 125(1):200\u2013211","journal-title":"Int J Prod Econ"},{"issue":"6","key":"9030_CR3","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1016\/j.cor.2010.09.018","volume":"39","author":"B Cesaret","year":"2012","unstructured":"Cesaret B, O\u011fuz C, Salman FS (2012) A tabu search algorithm for order acceptance and scheduling. Comput Oper Res 39(6):1197\u20131205","journal-title":"Comput Oper Res"},{"key":"9030_CR4","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1016\/j.asoc.2017.10.015","volume":"71","author":"G-H Wu","year":"2018","unstructured":"Wu G-H, Cheng C-Y, Yang H-I, Chena C-T (2018) An improved water flow-like algorithm for order acceptance and scheduling with identical parallel machines. Appl Soft Comput 71:1072\u20131084","journal-title":"Appl Soft Comput"},{"key":"9030_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.cor.2018.12.016","volume":"104","author":"S Wang","year":"2019","unstructured":"Wang S, Ye B (2019) Exact methods for order acceptance and scheduling on unrelated parallel machines. Comput Oper Res 104:159\u2013173","journal-title":"Comput Oper Res"},{"key":"9030_CR6","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.cie.2018.11.021","volume":"127","author":"Z Wang","year":"2019","unstructured":"Wang Z, Qi Y, Cui H, Zhang J (2019) A hybrid algorithm for order acceptance and scheduling problem in make-to-stock\/make-to-order industries. Comput Ind Eng 127:841\u2013852","journal-title":"Comput Ind Eng"},{"key":"9030_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105414","volume":"134","author":"\u0130 Tarhan","year":"2021","unstructured":"Tarhan \u0130, O\u011fuz C (2021) Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics. Comput Oper Res 134:105414","journal-title":"Comput Oper Res"},{"key":"9030_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108899","volume":"175","author":"S Wang","year":"2023","unstructured":"Wang S, Wu R, Chu F, Yu J (2023) An exact decomposition method for unrelated parallel machine scheduling with order acceptance and setup times. Comput Ind Eng 175:108899","journal-title":"Comput Ind Eng"},{"issue":"2","key":"9030_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1057\/jors.2012.47","volume":"64","author":"S-W Lin","year":"2013","unstructured":"Lin S-W, Ying K-C (2013) Increasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithm. J Oper Res Soc 64(2):293\u2013311","journal-title":"J Oper Res Soc"},{"key":"9030_CR10","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.asoc.2016.09.051","volume":"52","author":"SN Chaurasia","year":"2017","unstructured":"Chaurasia SN, Singh A (2017) Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem. Appl Soft Comput 52:725\u2013747","journal-title":"Appl Soft Comput"},{"key":"9030_CR11","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning. arXiv:1611.09940"},{"key":"9030_CR12","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.procir.2018.03.212","volume":"72","author":"B Waschneck","year":"2018","unstructured":"Waschneck B, Reichstaller A, Belzner L, Altenm\u00fcller T, Bauernhansl T, Knapp A, Kyek A (2018) Optimization of global production scheduling with deep reinforcement learning. Procedia Cirp 72:1264\u20131269","journal-title":"Procedia Cirp"},{"issue":"13","key":"9030_CR13","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1016\/j.ifacol.2019.11.397","volume":"52","author":"H Rummukainen","year":"2019","unstructured":"Rummukainen H, Nurminen JK (2019) Practical reinforcement learning-experiences in lot scheduling application. IFAC-PapersOnLine 52(13):1415\u20131420","journal-title":"IFAC-PapersOnLine"},{"key":"9030_CR14","first-page":"1621","volume":"33","author":"C Zhang","year":"2020","unstructured":"Zhang C, Song W, Cao Z, Zhang J, Tan PS, Chi X (2020) Learning to dispatch for job shop scheduling via deep reinforcement learning. Adv Neural Inf Process Syst 33:1621\u20131632","journal-title":"Adv Neural Inf Process Syst"},{"key":"9030_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2020.106982","volume":"141","author":"CD Hubbs","year":"2020","unstructured":"Hubbs CD, Li C, Sahinidis NV, Grossmann IE, Wassick JM (2020) A deep reinforcement learning approach for chemical production scheduling. Comput Chem Eng 141:106982","journal-title":"Comput Chem Eng"},{"issue":"3","key":"9030_CR16","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2017.03.031","volume":"261","author":"Y Marinakis","year":"2017","unstructured":"Marinakis Y, Migdalas A, Sifaleras A (2017) A hybrid particle swarm optimization-variable neighborhood search algorithm for constrained shortest path problems. Eur J Oper Res 261(3):819\u2013834","journal-title":"Eur J Oper Res"},{"key":"9030_CR17","doi-asserted-by":"publisher","first-page":"3101","DOI":"10.1007\/s00521-018-3808-3","volume":"32","author":"I Tariq","year":"2020","unstructured":"Tariq I, AlSattar HA, Zaidan A, Zaidan B, Abu Bakar M, Mohammed R, Albahri OS, Alsalem M, Albahri AS (2020) Mogsabat: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems. Neural Comput Appl 32:3101\u20133115","journal-title":"Neural Comput Appl"},{"key":"9030_CR18","doi-asserted-by":"publisher","DOI":"10.4108\/airo.3547","author":"H Hoorfar","year":"2023","unstructured":"Hoorfar H, Kosarirad H, Taheri N, Fathi F, Bagheri A (2023) Concealing robots in environments: enhancing navigation and privacy through stealth integration. EAI Endorsed Trans AI Robot. https:\/\/doi.org\/10.4108\/airo.3547","journal-title":"EAI Endorsed Trans AI Robot"},{"key":"9030_CR19","doi-asserted-by":"publisher","DOI":"10.4108\/airo.3492","author":"H Hoorfar","year":"2023","unstructured":"Hoorfar H, Taheri N, Kosarirad H, Bagheri A (2023) Efficiently guiding k-robots along pathways with minimal turns. EAI Endorsed Trans AI Robot. https:\/\/doi.org\/10.4108\/airo.3492","journal-title":"EAI Endorsed Trans AI Robot"},{"key":"9030_CR20","doi-asserted-by":"crossref","unstructured":"Yavary A, Sajedi H (2018) Solving dynamic vehicle routing problem with pickup and delivery by clarity method. In: 2018 IEEE 22nd international conference on intelligent engineering systems (INES), pp 000207\u2013000212. IEEE","DOI":"10.1109\/INES.2018.8523908"},{"key":"9030_CR21","doi-asserted-by":"crossref","unstructured":"Pourghorban A, Maity D (2023) Target defense against a sequentially arriving cooperative intruder team. In: Open architecture\/open business model net-centric systems and defense transformation, vol 12544. SPIE, pp 65\u201377","DOI":"10.1117\/12.2663418"},{"key":"9030_CR22","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE congress on evolutionary computation. Ieee, pp 4661\u20134667","DOI":"10.1109\/CEC.2007.4425083"},{"key":"9030_CR23","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.cie.2016.08.027","volume":"101","author":"A Ghorbani","year":"2016","unstructured":"Ghorbani A, Jokar MRA (2016) A hybrid imperialist competitive-simulated annealing algorithm for a multisource multi-product location-routing-inventory problem. Comput Ind Eng 101:116\u2013127","journal-title":"Comput Ind Eng"},{"key":"9030_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106069","volume":"137","author":"D Peri","year":"2019","unstructured":"Peri D (2019) Hybridization of the imperialist competitive algorithm and local search with application to ship design optimization. Comput Ind Eng 137:106069","journal-title":"Comput Ind Eng"},{"key":"9030_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.swevo.2017.12.001","volume":"40","author":"MR Maheri","year":"2018","unstructured":"Maheri MR, Talezadeh M (2018) An enhanced imperialist competitive algorithm for optimum design of skeletal structures. Swarm Evol Comput 40:24\u201336","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"9030_CR26","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1051\/ro\/2019018","volume":"53","author":"MB Fakhrzad","year":"2019","unstructured":"Fakhrzad MB, Goodarzian F (2019) A fuzzy multi-objective programming approach to develop a green closed-loop supply chain network design problem under uncertainty: modifications of imperialist competitive algorithm. RAIRO-Oper Res 53(3):963\u2013990","journal-title":"RAIRO-Oper Res"},{"key":"9030_CR27","doi-asserted-by":"crossref","unstructured":"Mahmoudinazlou S, Kwon C (2023) A hybrid genetic algorithm with type-aware chromosomes for traveling salesman problems with drone. arXiv:2303.00614","DOI":"10.1016\/j.cor.2023.106455"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09030-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09030-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09030-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T02:08:59Z","timestamp":1704420539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09030-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,7]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["9030"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09030-w","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,7]]},"assertion":[{"value":"24 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}