{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:04:35Z","timestamp":1778659475941,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10898-020-00884-1","type":"journal-article","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T07:02:33Z","timestamp":1580713353000},"page":"349-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints"],"prefix":"10.1007","volume":"78","author":[{"given":"Issam","family":"Krimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9321-3464","authenticated-orcid":false,"given":"Raca","family":"Todosijevi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustapha","family":"Ratli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdessamad Ait","family":"El Cadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Afaf","family":"Aloullal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,3]]},"reference":[{"issue":"1","key":"884_CR1","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ejor.2017.05.040","volume":"264","author":"A Agra","year":"2018","unstructured":"Agra, A., Oliveira, M.: Mip approaches for the integrated berth allocation and quay crane assignment and scheduling problem. Eur. J. Oper. Res. 264(1), 138\u2013148 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"884_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.cie.2010.12.018","volume":"60","author":"VH Barros","year":"2011","unstructured":"Barros, V.H., Costa, T.S., Oliveira, A.C., Lorena, L.A.: Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Comput. Ind. Eng. 60(4), 606\u2013613 (2011)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"884_CR3","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.ejor.2004.07.023","volume":"168","author":"C Becker","year":"2006","unstructured":"Becker, C., Scholl, A.: A survey on problems and methods in generalized assembly line balancing. Eur. J. Oper. Res. 168(3), 694\u2013715 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"884_CR4","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.ejor.2014.12.030","volume":"244","author":"C Bierwirth","year":"2015","unstructured":"Bierwirth, C., Meisel, F.: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 244(3), 675\u2013689 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"884_CR5","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1057\/jors.2010.54","volume":"62","author":"J Blazewicz","year":"2011","unstructured":"Blazewicz, J., Cheng, T.E., Machowiak, M., Oguz, C.: Berth and quay crane allocation: a moldable task scheduling model. J. Oper. Res. Soc. 62(7), 1189\u20131197 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"884_CR6","doi-asserted-by":"publisher","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.: Integrating berth allocation and quay crane assignments. Transp. Res. Part E: Logist Transp. Rev. 46(6), 975\u2013990 (2010)","journal-title":"Transp. Res. Part E: Logist Transp. Rev."},{"key":"884_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.eswa.2017.07.028","volume":"89","author":"JF Correcher","year":"2017","unstructured":"Correcher, J.F., Alvarez-Valdes, R.: A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem. Expert Syst. Appl. 89, 112\u2013128 (2017)","journal-title":"Expert Syst. Appl."},{"key":"884_CR8","volume-title":"A New Mixed Integer Linear Model for the Berth Allocation and Quay Crane Assignment problem","author":"JF Correcher","year":"2017","unstructured":"Correcher, J.F., Alvarez-Valdes, R., Tamarit, J.M.: A New Mixed Integer Linear Model for the Berth Allocation and Quay Crane Assignment problem. Department of Statistics and Operations Research. University of Valencia, Valencia (2017)"},{"key":"884_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cie.2013.12.012","volume":"73","author":"A Diabat","year":"2014","unstructured":"Diabat, A., Theodorou, E.: An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 73, 115\u2013123 (2014)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"884_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10951-017-0510-8","volume":"20","author":"AT Ernst","year":"2017","unstructured":"Ernst, A.T., O\u011fuz, C., Singh, G., Taherkhani, G.: Mathematical models for the berth allocation problem in dry bulk terminals. J. Sched. 20(5), 459\u2013473 (2017)","journal-title":"J. Sched."},{"issue":"3\u20134","key":"884_CR11","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.apm.2014.07.006","volume":"39","author":"YM Fu","year":"2015","unstructured":"Fu, Y.M., Diabat, A.: A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl. Math. Model. 39(3\u20134), 1194\u20131201 (2015)","journal-title":"Appl. Math. Model."},{"issue":"2","key":"884_CR12","doi-asserted-by":"publisher","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.: Modeling and solving the tactical berth allocation problem. Transp. Res. Part B: Methodol. 44(2), 232\u2013245 (2010)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"11","key":"884_CR13","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"884_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"884_CR15","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","volume":"191","author":"P Hansen","year":"2008","unstructured":"Hansen, P., O\u011fuz, C., Mladenovi\u0107, N.: Variable neighborhood search for minimum cost berth allocation. Eur. J. Oper. Res. 191(3), 636\u2013649 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"884_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.tre.2017.06.013","volume":"105","author":"\u00c7 Iris","year":"2017","unstructured":"Iris, \u00c7., Pacino, D., Ropke, S.: Improved formulations and an adaptive large neighborhood search heuristic for the integrated berth allocation and quay crane assignment problem. Transp. Res. Part E: Logist. Transp. Rev. 105, 123\u2013147 (2017)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"884_CR17","doi-asserted-by":"publisher","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.: Integrated berth allocation and quay crane assignment problem: set partitioning models and computational results. Transp. Res. Part E: Logist. Transp. Rev. 81, 75\u201397 (2015)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"3","key":"884_CR18","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1016\/j.ejor.2015.10.021","volume":"250","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: A set-partitioning-based model for the berth allocation problem under time-dependent limitations. Eur. J. Oper. Res. 250(3), 1001\u20131012 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"884_CR19","doi-asserted-by":"publisher","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.: A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput. Ind. Eng. 56(3), 1021\u20131028 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"884_CR20","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.tre.2008.03.001","volume":"45","author":"F Meisel","year":"2009","unstructured":"Meisel, F., Bierwirth, C.: Heuristics for the integration of crane productivity in the berth allocation problem. Transp. Res. Part E: Logist. Transp. Rev. 45(1), 196\u2013209 (2009)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"3","key":"884_CR21","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1111\/itor.12282","volume":"24","author":"A Mjirda","year":"2017","unstructured":"Mjirda, A., Todosijevi\u0107, R., Hanafi, S., Hansen, P., Mladenovi\u0107, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24(3), 615\u2013633 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"884_CR22","doi-asserted-by":"crossref","unstructured":"Park, Y.M., Kim, K.H.: A scheduling method for berth and quay cranes. In: Container Terminals and Automated Transport Systems, pp. 159\u2013181. Springer (2005)","DOI":"10.1007\/3-540-26686-0_7"},{"key":"884_CR23","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.cie.2016.12.009","volume":"106","author":"S Pratap","year":"2017","unstructured":"Pratap, S., Nayak, A., Kumar, A., Cheikhrouhou, N., Tiwari, M.K.: An integrated decision support system for berth and ship unloader allocation in bulk material handling port. Comput. Ind. Eng 106, 386\u2013399 (2017)","journal-title":"Comput. Ind. Eng"},{"issue":"11","key":"884_CR24","first-page":"14136","volume":"38","author":"B Raa","year":"2011","unstructured":"Raa, B., Dullaert, W., Van Schaeren, R.: An enriched model for the integrated berth allocation and quay crane assignment problem. Expert Syst. Appl. 38(11), 14136\u201314147 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"884_CR25","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10489-013-0462-4","volume":"40","author":"M Rodriguez-Molins","year":"2014","unstructured":"Rodriguez-Molins, M., Salido, M.A., Barber, F.: A grasp-based metaheuristic for the berth allocation problem and the quay crane assignment problem by managing vessel cargo holds. Appl. Intell 40(2), 273\u2013290 (2014)","journal-title":"Appl. Intell"},{"key":"884_CR26","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tre.2013.03.003","volume":"54","author":"N Umang","year":"2013","unstructured":"Umang, N., Bierlaire, M., Vacca, I.: Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp. Res. Part E: Logist. Transp. Rev. 54, 14\u201331 (2013)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"2","key":"884_CR27","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/trsc.1120.0428","volume":"47","author":"I Vacca","year":"2013","unstructured":"Vacca, I., Salani, M., Bierlaire, M.: An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transp. Sci. 47(2), 148\u2013161 (2013)","journal-title":"Transp. Sci."},{"issue":"1","key":"884_CR28","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejor.2011.07.012","volume":"216","author":"D Xu","year":"2012","unstructured":"Xu, D., Li, C.L., Leung, J.Y.T.: Berth allocation with time-dependent physical limitations on vessels. Eur. J. Oper. Res. 216(1), 47\u201356 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"884_CR29","doi-asserted-by":"publisher","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.: An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal. Comput. Ind. Eng. 63(1), 243\u2013253 (2012)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"884_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/0305215X.2018.1473390","volume":"51","author":"T Yu","year":"2019","unstructured":"Yu, T., Qiang, Z., Benfei, Z.: A genetic algorithm based on spatiotemporal conflict between continuous berth-allocation and time-varying specific crane assignment. Eng. Optim. 51(3), 1\u201322 (2019)","journal-title":"Eng. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00884-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00884-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00884-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T00:18:35Z","timestamp":1612225115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00884-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["884"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00884-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,3]]},"assertion":[{"value":"18 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}