{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:38:39Z","timestamp":1773085119568,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12351-025-00940-2","type":"journal-article","created":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T14:53:21Z","timestamp":1748789601000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An accelerated Benders decomposition algorithm for integrated seaside operations planning with berthing preemption"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2061-3619","authenticated-orcid":false,"given":"Amirsalar","family":"Malekahmadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Alinaghian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Reza","family":"Hejazi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,1]]},"reference":[{"key":"940_CR1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.cor.2019.03.014","volume":"107","author":"O Abou Kasm","year":"2019","unstructured":"Abou Kasm O, Diabat A (2019) The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach. Comput Oper Res 107:189\u2013199","journal-title":"Comput Oper Res"},{"key":"940_CR2","doi-asserted-by":"crossref","unstructured":"Abou Kasm, O., Diabat, A. and Cheng, T. (2019). The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study. Annals of Operations Research, 1\u201327.","DOI":"10.1007\/s10479-018-3125-3"},{"issue":"1","key":"940_CR3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ejor.2017.05.040","volume":"264","author":"A Agra","year":"2018","unstructured":"Agra A, Oliveira M (2018) MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. Eur J Oper Res 264(1):138\u2013148","journal-title":"Eur J Oper Res"},{"key":"940_CR4","unstructured":"Ak, A. (2008). Berth and quay crane scheduling: problems, models and solution methods. Georgia Institute of Technology."},{"key":"940_CR5","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.cie.2016.01.011","volume":"94","author":"N Al-Dhaheri","year":"2016","unstructured":"Al-Dhaheri N, Jebali A, Diabat A (2016) The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints. Comput Ind Eng 94:230\u2013244","journal-title":"Comput Ind Eng"},{"key":"940_CR6","doi-asserted-by":"crossref","unstructured":"Aras, N., T\u00fcrko\u011fullar\u0131, Y., Ta\u015fk\u0131n, Z.C. and Alt\u0131nel, K. (2014). Simultaneous optimization of berth allocation, quay crane assignment and quay crane scheduling problems in container terminals. In: operations research proceedings 2012 (pp. 101\u2013107): Springer.","DOI":"10.1007\/978-3-319-00795-3_15"},{"key":"940_CR7","doi-asserted-by":"crossref","unstructured":"Barbosa, F., Oliveira, J.F., Carravilla, M.A. and Curcio, E.F. (2018). A Benders Decomposition Algorithm for the Berth Allocation Problem. In: Congress of APDIO, the portuguese operational research Society (pp. 29\u201341): Springer.","DOI":"10.1007\/978-3-030-10731-4_3"},{"key":"940_CR8","doi-asserted-by":"crossref","unstructured":"Benders, J. (1962). Partitioning Procedures for Solving Mixed-Variable Program-ming Problems, Numerische Matkematic 4. In: SS8.","DOI":"10.1007\/BF01386316"},{"issue":"3","key":"940_CR9","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"C Bierwirth","year":"2010","unstructured":"Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202(3):615\u2013627","journal-title":"Eur J Oper Res"},{"issue":"3","key":"940_CR10","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.ejor.2014.12.030","volume":"244","author":"C Bierwirth","year":"2015","unstructured":"Bierwirth C, Meisel F (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 244(3):675\u2013689","journal-title":"Eur J Oper Res"},{"issue":"7","key":"940_CR11","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1057\/jors.2010.54","volume":"62","author":"J Blazewicz","year":"2011","unstructured":"Blazewicz J, Cheng TE, Machowiak M, Oguz C (2011) Berth and quay crane allocation: a moldable task scheduling model. J Operat Res Soc 62(7):1189\u20131197","journal-title":"J Operat Res Soc"},{"issue":"3","key":"940_CR12","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.tre.2009.08.012","volume":"46","author":"JX Cao","year":"2010","unstructured":"Cao JX, Lee D-H, Chen JH, Shi Q (2010) The integrated yard truck and yard crane scheduling problem: Benders\u2019 decomposition-based methods. Trans Res Part E: Logis Trans Rev 46(3):344\u2013353","journal-title":"Trans Res Part E: Logis Trans Rev"},{"issue":"6","key":"940_CR13","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.tre.2010.05.008","volume":"46","author":"D Chang","year":"2010","unstructured":"Chang D, Jiang Z, Yan W, He J (2010) Integrating berth allocation and quay crane assignments. Trans Res Part E: Logis Trans Rev 46(6):975\u2013990","journal-title":"Trans Res Part E: Logis Trans Rev"},{"key":"940_CR14","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102449","volume":"154","author":"K Chargui","year":"2021","unstructured":"Chargui K, Zouadi T, El Fallahi A, Reghioui M, Aouam T (2021) Berth and quay crane allocation and scheduling with worker performance variability and yard truck deployment in container terminals. Trans Res Part e: Log Trans Rev 154:102449","journal-title":"Trans Res Part e: Log Trans Rev"},{"key":"940_CR15","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105695","volume":"141","author":"N Cheimanoff","year":"2022","unstructured":"Cheimanoff N, Fontane F, Kitri MN, Tchernev N (2022) Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems. Comput Oper Res 141:105695","journal-title":"Comput Oper Res"},{"issue":"1","key":"940_CR16","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.tre.2011.06.004","volume":"48","author":"JH Chen","year":"2012","unstructured":"Chen JH, Lee D-H, Cao JX (2012) A combinatorial benders\u2019 cuts algorithm for the quayside operation problem at container terminals. Trans Res Part e: Logis Trans Rev 48(1):266\u2013275","journal-title":"Trans Res Part e: Logis Trans Rev"},{"issue":"4","key":"940_CR17","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato G, Fischetti M (2006) Combinatorial Benders\u2019 cuts for mixed-integer linear programming. Oper Res 54(4):756\u2013766","journal-title":"Oper Res"},{"issue":"4","key":"940_CR18","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.49.4.531.11226","volume":"49","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau J-F, Soumis F, Desrosiers J (2001) Simultaneous assignment of locomotives and cars to passenger trains. Oper Res 49(4):531\u2013548","journal-title":"Oper Res"},{"key":"940_CR19","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2013.12.012","volume":"73","author":"A Diabat","year":"2014","unstructured":"Diabat A, Theodorou E (2014) An integrated quay crane assignment and scheduling problem. Comput Ind Eng 73:115\u2013123","journal-title":"Comput Ind Eng"},{"issue":"1","key":"940_CR20","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s10696-016-9264-4","volume":"29","author":"G Dik","year":"2017","unstructured":"Dik G, Kozan E (2017) A flexible crane scheduling methodology for container terminals. Flex Serv Manuf J 29(1):64\u201396","journal-title":"Flex Serv Manuf J"},{"issue":"3\u20134","key":"940_CR21","first-page":"1194","volume":"39","author":"Y-M Fu","year":"2015","unstructured":"Fu Y-M, Diabat A (2015) A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl Math Model 39(3\u20134):1194\u20131201","journal-title":"Appl Math Model"},{"issue":"15","key":"940_CR22","doi-asserted-by":"crossref","first-page":"6959","DOI":"10.1016\/j.eswa.2014.05.002","volume":"41","author":"Y-M Fu","year":"2014","unstructured":"Fu Y-M, Diabat A, Tsai I-T (2014) A multi-vessel quay crane assignment and scheduling problem: formulation and heuristic solution approach. Expert Syst Appl 41(15):6959\u20136965","journal-title":"Expert Syst Appl"},{"issue":"5","key":"940_CR23","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Manage Sci 20(5):822\u2013844","journal-title":"Manage Sci"},{"issue":"2","key":"940_CR24","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.trb.2009.07.003","volume":"44","author":"G Giallombardo","year":"2010","unstructured":"Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Trans Res Part B: Methodol 44(2):232\u2013245","journal-title":"Trans Res Part B: Methodol"},{"issue":"1","key":"940_CR25","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1017\/S0269888900001077","volume":"15","author":"J Hooker","year":"2000","unstructured":"Hooker J, Ottosson G, Thorsteinsson ES, Kim H-J (2000) A scheme for unifying optimization and constraint satisfaction methods. Knowl Eng Rev 15(1):11\u201330","journal-title":"Knowl Eng Rev"},{"issue":"5","key":"940_CR26","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.tre.2007.03.003","volume":"44","author":"A Imai","year":"2008","unstructured":"Imai A, Chen HC, Nishimura E, Papadimitriou S (2008) The simultaneous berth and quay crane allocation problem. Trans Res Part E: Logis Trans Rev 44(5):900\u2013920","journal-title":"Trans Res Part E: Logis Trans Rev"},{"key":"940_CR27","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tre.2015.06.008","volume":"81","author":"\u00c7 Iris","year":"2015","unstructured":"Iris \u00c7, Pacino D, Ropke S, Larsen A (2015) Integrated berth allocation and quay crane assignment problem: set partitioning models and computational results. Trans Res Part e: Logis Trans Rev 81:75\u201397","journal-title":"Trans Res Part e: Logis Trans Rev"},{"key":"940_CR28","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107734","volume":"165","author":"N Kenan","year":"2022","unstructured":"Kenan N, Jebali A, Diabat A (2022) The integrated quay crane assignment and scheduling problems with carbon emissions considerations. Comput Ind Eng 165:107734","journal-title":"Comput Ind Eng"},{"issue":"3","key":"940_CR29","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1016\/j.cie.2008.09.024","volume":"56","author":"C Liang","year":"2009","unstructured":"Liang C, Huang Y, Yang Y (2009) A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput Ind Eng 56(3):1021\u20131028","journal-title":"Comput Ind Eng"},{"issue":"2\u20133","key":"940_CR30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(98)00010-8","volume":"22","author":"A Lim","year":"1998","unstructured":"Lim A (1998) The berth planning problem. Oper Res Lett 22(2\u20133):105\u2013110","journal-title":"Oper Res Lett"},{"issue":"1","key":"940_CR31","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/nav.20108","volume":"53","author":"J Liu","year":"2006","unstructured":"Liu J, Wan YW, Wang L (2006) Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Naval Res Logis (NRL) 53(1):60\u201374. https:\/\/doi.org\/10.1002\/nav.20108","journal-title":"Naval Res Logis (NRL)"},{"key":"940_CR32","volume":"256","author":"W Liu","year":"2022","unstructured":"Liu W, Zhu X, Wang L, Li S (2022) Rolling horizon based robust optimization method of quayside operations in maritime container ports. Ocean Eng 256:111505","journal-title":"Ocean Eng"},{"issue":"3","key":"940_CR33","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.1016\/j.ejor.2010.07.018","volume":"207","author":"Z-Q Lu","year":"2010","unstructured":"Lu Z-Q, Xi L-F (2010) A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. Eur J Oper Res 207(3):1327\u20131340","journal-title":"Eur J Oper Res"},{"issue":"3","key":"940_CR34","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"TL Magnanti","year":"1981","unstructured":"Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Oper Res 29(3):464\u2013484","journal-title":"Oper Res"},{"key":"940_CR35","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106672","volume":"147","author":"A Malekahmadi","year":"2020","unstructured":"Malekahmadi A, Alinaghian M, Hejazi SR, Saidipour MAA (2020) Integrated continuous berth allocation and quay crane assignment and scheduling problem with time-dependent physical constraints in container terminals. Comput Ind Eng 147:106672","journal-title":"Comput Ind Eng"},{"issue":"3","key":"940_CR36","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/mnsc.24.3.312","volume":"24","author":"D McDaniel","year":"1977","unstructured":"McDaniel D, Devine M (1977) A modified Benders\u2019 partitioning algorithm for mixed integer programming. Manage Sci 24(3):312\u2013319","journal-title":"Manage Sci"},{"issue":"1","key":"940_CR37","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tre.2008.03.001","volume":"45","author":"F Meisel","year":"2009","unstructured":"Meisel F, Bierwirth C (2009) Heuristics for the integration of crane productivity in the berth allocation problem. Trans Res Part e: Logis Trans Rev 45(1):196\u2013209","journal-title":"Trans Res Part e: Logis Trans Rev"},{"issue":"2","key":"940_CR38","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/trsc.1120.0419","volume":"47","author":"F Meisel","year":"2013","unstructured":"Meisel F, Bierwirth C (2013) A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp Sci 47(2):131\u2013147","journal-title":"Transp Sci"},{"key":"940_CR39","doi-asserted-by":"crossref","unstructured":"Msakni, M.K., Al-Salem, M., Diabat, A., Rabadi, G. and Kotachi, M. (2016). An integrated quay crane assignment and scheduling problem using branch-and-price. In: 2016 International conference on computational science and computational intelligence (CSCI) (pp. 1286\u20131291): IEEE.","DOI":"10.1109\/CSCI.2016.0241"},{"issue":"4","key":"940_CR40","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.orl.2008.01.005","volume":"36","author":"N Papadakos","year":"2008","unstructured":"Papadakos N (2008) Practical enhancements to the Magnanti-Wong method. Oper Res Lett 36(4):444\u2013449","journal-title":"Oper Res Lett"},{"key":"940_CR41","doi-asserted-by":"crossref","unstructured":"Park, Y.-M. and Kim, K.H. (2005). A scheduling method for berth and quay cranes. In: container terminals and automated transport systems (pp. 159\u2013181): Springer.","DOI":"10.1007\/3-540-26686-0_7"},{"issue":"11","key":"940_CR42","first-page":"14136","volume":"38","author":"B Raa","year":"2011","unstructured":"Raa B, Dullaert W, Van Schaeren R (2011) An enriched model for the integrated berth allocation and quay crane assignment problem. Expert Syst Appl 38(11):14136\u201314147","journal-title":"Expert Syst Appl"},{"issue":"3","key":"940_CR43","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The Benders decomposition algorithm: a literature review. Eur J Oper Res 259(3):801\u2013817","journal-title":"Eur J Oper Res"},{"issue":"2","key":"940_CR44","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.ejor.2021.03.016","volume":"295","author":"F Rodrigues","year":"2021","unstructured":"Rodrigues F, Agra A (2021) An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times. Eur J Oper Res 295(2):499\u2013516","journal-title":"Eur J Oper Res"},{"issue":"2","key":"940_CR45","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.ejor.2021.12.040","volume":"303","author":"F Rodrigues","year":"2022","unstructured":"Rodrigues F, Agra A (2022) Berth allocation and quay crane assignment\/scheduling problem under uncertainty: a survey. Euro J Operat Res 303(2):501\u2013524. https:\/\/doi.org\/10.1016\/j.ejor.2021.12.040","journal-title":"Euro J Operat Res"},{"key":"940_CR46","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/j.cie.2018.07.047","volume":"124","author":"M Rohaninejad","year":"2018","unstructured":"Rohaninejad M, Sahraeian R, Tavakkoli-Moghaddam R (2018) An accelerated benders decomposition algorithm for reliable facility location problems in multi-echelon networks. Comput Ind Eng 124:523\u2013534","journal-title":"Comput Ind Eng"},{"issue":"8","key":"940_CR47","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1016\/j.compchemeng.2009.02.005","volume":"33","author":"GK Saharidis","year":"2009","unstructured":"Saharidis GK, Minoux M, Dallery Y (2009) Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation. Comput Chem Eng 33(8):1413\u20131426","journal-title":"Comput Chem Eng"},{"key":"940_CR48","doi-asserted-by":"crossref","unstructured":"Schoonenberg, W.C., Hols, J.X. & Diabat, A. (2015). A cost based approach for a crane assignment and scheduling problem. In: 2015 International Conference on Industrial Engineering and Systems Management (IESM) (pp. 647\u2013653): IEEE.","DOI":"10.1109\/IESM.2015.7380227"},{"key":"940_CR49","unstructured":"Sirimanne SN, Hoffman J, Juan W, Asariotis R, Assaf M, Ayala G, Benamara H, Chantrel D, Hoffmann J, Premti A. Review of maritime transport 2019. InUnited Nations conference on trade and development, Geneva, Switzerland 2019 9"},{"issue":"1","key":"940_CR50","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.cie.2011.08.024","volume":"62","author":"L Song","year":"2012","unstructured":"Song L, Cherrett T, Guan W (2012) Study on berth planning problem in a container seaport: using an integrated programming approach. Comput Ind Eng 62(1):119\u2013128","journal-title":"Comput Ind Eng"},{"issue":"2","key":"940_CR51","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.ejor.2018.08.009","volume":"273","author":"D Sun","year":"2019","unstructured":"Sun D, Tang L, Baldacci R (2019) A benders decomposition-based framework for solving quay crane scheduling problems. Eur J Oper Res 273(2):504\u2013515","journal-title":"Eur J Oper Res"},{"issue":"9","key":"940_CR52","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.3390\/jmse10091232","volume":"10","author":"NA Tengecha","year":"2022","unstructured":"Tengecha NA, Zhang X (2022) An efficient algorithm for the berth and quay crane assignments considering operator performance in container terminal using particle swarm model. J Marine Sci Eng 10(9):1232","journal-title":"J Marine Sci Eng"},{"issue":"4","key":"940_CR53","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1007\/s11590-014-0787-x","volume":"9","author":"E Theodorou","year":"2015","unstructured":"Theodorou E, Diabat A (2015) A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results. Optimization Letters 9(4):799\u2013817","journal-title":"Optimization Letters"},{"issue":"1","key":"940_CR54","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ejor.2013.10.015","volume":"235","author":"YB T\u00fcrko\u011fullar\u0131","year":"2014","unstructured":"T\u00fcrko\u011fullar\u0131 YB, Ta\u015fk\u0131n ZC, Aras N, Alt\u0131nel \u0130K (2014) Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur J Oper Res 235(1):88\u2013101","journal-title":"Eur J Oper Res"},{"key":"940_CR55","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.tre.2013.08.006","volume":"59","author":"O Unsal","year":"2013","unstructured":"Unsal O, Oguz C (2013) Constraint programming approach to quay crane scheduling problem. Trans Res Part E: Logis Trans Rev 59:108\u2013122","journal-title":"Trans Res Part E: Logis Trans Rev"},{"issue":"2","key":"940_CR56","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/trsc.1120.0428","volume":"47","author":"I Vacca","year":"2013","unstructured":"Vacca I, Salani M, Bierlaire M (2013) An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transp Sci 47(2):148\u2013161","journal-title":"Transp Sci"},{"issue":"1","key":"940_CR57","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BF02591718","volume":"25","author":"TJ Van Roy","year":"1983","unstructured":"Van Roy TJ (1983) Cross decomposition for mixed integer programming. Math Program 25(1):46\u201363","journal-title":"Math Program"},{"issue":"1","key":"940_CR58","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.cie.2012.03.004","volume":"63","author":"C Yang","year":"2012","unstructured":"Yang C, Wang X, Li Z (2012) An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal. Comput Ind Eng 63(1):243\u2013253","journal-title":"Comput Ind Eng"},{"issue":"6","key":"940_CR59","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1080\/03088839.2020.1730994","volume":"47","author":"MS Y\u0131ld\u0131r\u0131m","year":"2020","unstructured":"Y\u0131ld\u0131r\u0131m MS, Ayd\u0131n MM, G\u00f6kku\u015f \u00dc (2020) Simulation optimization of the berth allocation in a container terminal with flexible vessel priority management. Marit Policy Manag 47(6):833\u2013848","journal-title":"Marit Policy Manag"},{"issue":"1","key":"940_CR60","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cie.2009.08.002","volume":"58","author":"C Zhang","year":"2010","unstructured":"Zhang C, Zheng L, Zhang Z, Shi L, Armstrong AJ (2010) The allocation of berths and quay cranes by using a sub-gradient optimization technique. Comput Ind Eng 58(1):40\u201350","journal-title":"Comput Ind Eng"},{"issue":"12","key":"940_CR61","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1057\/palgrave.jors.2602110","volume":"57","author":"Y Zhu","year":"2006","unstructured":"Zhu Y, Lim A (2006) Crane scheduling with non-crossing constraint. J Operat Res Soc 57(12):1464\u20131471","journal-title":"J Operat Res Soc"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00940-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-025-00940-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00940-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T13:08:08Z","timestamp":1759151288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-025-00940-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,1]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["940"],"URL":"https:\/\/doi.org\/10.1007\/s12351-025-00940-2","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,1]]},"assertion":[{"value":"1 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2025","order":4,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"61"}}