{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T03:49:25Z","timestamp":1784432965062,"version":"3.55.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T00:00:00Z","timestamp":1546387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T00:00:00Z","timestamp":1546387200000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10479-018-3125-3","type":"journal-article","created":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T05:47:14Z","timestamp":1546408034000},"page":"435-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":58,"title":["The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study"],"prefix":"10.1007","volume":"291","author":[{"given":"Omar","family":"Abou Kasm","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Diabat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,2]]},"reference":[{"key":"3125_CR1","unstructured":"Abou Kasm, O. & Diabat, A. (2019). The quay crane scheduling problem with non-crossing and safety clearance constraints: An exact solution approach. Computers & Operations Research (in press)."},{"key":"3125_CR2","unstructured":"Abu Dhabi Ports. (2018). Abu Dhabi terminal. Retrieved October 4, 2018, from \nhttps:\/\/www.adports.ae\/gallery_posts\/abu-dhabi-terminal\/\n\n."},{"issue":"1","key":"3125_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. European Journal of Operational Research, 264(1), 138\u2013148.","journal-title":"European Journal of Operational Research"},{"key":"3125_CR4","doi-asserted-by":"crossref","unstructured":"Aras, N., Trkoullar, Y., Takn, Z. C., & Altnel, 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, Cham.","DOI":"10.1007\/978-3-319-00795-3_15"},{"issue":"1\u20132","key":"3125_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-016-2239-8","volume":"248","author":"N Al-Dhaheri","year":"2017","unstructured":"Al-Dhaheri, N., & Diabat, A. (2017). A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints. Annals of Operations Research, 248(1\u20132), 1\u201324.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"3125_CR6","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. European Journal of Operational Research, 202(3), 615\u2013627.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3125_CR7","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. European Journal of Operational Research, 244(3), 675\u2013689.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"3125_CR8","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. Transportation Research Part E: Logistics and Transportation Review, 46(6), 975\u2013990.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"3125_CR9","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/trsc.1090.0296","volume":"44","author":"S Choo","year":"2010","unstructured":"Choo, S., Klabjan, D., & Simchi-Levi, D. (2010). Multiship crane sequencing with yard congestion constraints. Transportation Science, 44(1), 98\u2013115.","journal-title":"Transportation Science"},{"key":"3125_CR10","doi-asserted-by":"crossref","unstructured":"He, J., Mi, W., Chang, D., & Yan, W. (2009). An investigation into berth allocation and quay crane assignment based on hybrid parallel genetic algorithm. In International Conference on Artificial intelligence and computational intelligence, 2009. AICI\u201909 (Vol. 2, pp. 48\u201353). IEEE.","DOI":"10.1109\/AICI.2009.41"},{"issue":"5","key":"3125_CR11","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, H. C., Nishimura, E., & Papadimitriou, S. (2008). The simultaneous berth and quay crane allocation problem. Transportation Research Part E: Logistics and Transportation Review, 44(5), 900\u2013920.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"3125_CR12","unstructured":"Knowler, G. (2016, February 22). Terminal costs rising and profits harder to find, Drewry says. Retrieved October 4, 2018, from \nhttps:\/\/www.joc.com\/port-news\/terminal-costs-rising-and-profits-harder-find-drewry-says_20160222.html\n\n."},{"issue":"8","key":"3125_CR13","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1080\/03052150903406571","volume":"42","author":"DH Lee","year":"2010","unstructured":"Lee, D. H., & Wang, Q. H. (2010). Integrated discrete berth allocation and quay crane scheduling in port container terminals. Engineering Optimization, 42(8), 747\u2013761.","journal-title":"Engineering Optimization"},{"issue":"3","key":"3125_CR14","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. Computers & Industrial Engineering, 56(3), 1021\u20131028.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"3125_CR15","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.1016\/j.ejor.2010.07.018","volume":"207","author":"ZQ 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. European Journal of Operational Research, 207(3), 1327\u20131340.","journal-title":"European Journal of Operational Research"},{"issue":"6\u20137","key":"3125_CR16","doi-asserted-by":"crossref","first-page":"2113","DOI":"10.1166\/asl.2011.1533","volume":"4","author":"Z Lu","year":"2011","unstructured":"Lu, Z., Han, X., & Xi, L. (2011). Simultaneous berth and quay crane allocation problem in container terminal. Advanced Science Letters, 4(6\u20137), 2113\u20132118.","journal-title":"Advanced Science Letters"},{"issue":"3","key":"3125_CR17","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.cor.2010.08.001","volume":"38","author":"F Meisel","year":"2011","unstructured":"Meisel, F., & Bierwirth, C. (2011). A unified approach for the evaluation of quay crane scheduling models and algorithms. Computers & Operations Research, 38(3), 683\u2013693.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3125_CR18","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. Transportation Science, 47(2), 131\u2013147.","journal-title":"Transportation Science"},{"key":"3125_CR19","doi-asserted-by":"crossref","unstructured":"Msakni, M. K., Al-Salem, M., Diabat, A., Rabadi, G., & 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"},{"key":"3125_CR20","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.cor.2018.07.005","volume":"99","author":"MK Msakni","year":"2018","unstructured":"Msakni, M. K., Diabat, A., Rabadi, G., Al-Salem, M., & Kotachi, M. (2018). Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level. Computers & Operations Research, 99, 218\u2013233.","journal-title":"Computers & Operations Research"},{"key":"3125_CR21","unstructured":"Park, Y. M., & Kim, K. H. (2005). A scheduling method for berth and quay cranes. In Container terminals and automated transport systems (pp. 159\u2013181). Berlin: Springer."},{"issue":"11","key":"3125_CR22","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 Systems with Applications, 38(11), 14136\u201314147.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"3125_CR23","doi-asserted-by":"crossref","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. (2014). A GRASP-based metaheuristic for the berth allocation problem and the quay crane assignment problem by managing vessel cargo holds. Applied Intelligence, 40(2), 273\u2013290.","journal-title":"Applied Intelligence"},{"issue":"4","key":"3125_CR24","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":"3125_CR25","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ejor.2013.10.015","volume":"235","author":"YB Trkoullar","year":"2014","unstructured":"Trkoullar, Y. B., Takn, Z. C., Aras, N., & Altnel, K. (2014). Optimal berth allocation and time-invariant quay crane assignment in container terminals. European Journal of Operational Research, 235(1), 88\u2013101.","journal-title":"European Journal of Operational Research"},{"key":"3125_CR26","unstructured":"United Nations Conference on Trade and Development. (2018). Review of maritime transport. Retrieved October 22, 2018, from \nhttps:\/\/unctad.org\/en\/PublicationsLibrary\/rmt2018_en.pdf\n\n."},{"key":"3125_CR27","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. Transportation Research Part E: Logistics and Transportation Review, 59, 108\u2013122.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"3125_CR28","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. Transportation Science, 47(2), 148\u2013161.","journal-title":"Transportation Science"},{"issue":"1","key":"3125_CR29","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. Computers & Industrial Engineering, 63(1), 243\u2013253.","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"3125_CR30","first-page":"2130","volume":"7","author":"Q Zeng","year":"2011","unstructured":"Zeng, Q., Hu, X., Wang, W., & Fang, Y. (2011). Disruption management model and its algorithms for berth allocation problem in container terminals. International Journal of Innovative Computing, Information and Control, 7(5), 2130\u20132142.","journal-title":"International Journal of Innovative Computing, Information and Control"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3125-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3125-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3125-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T09:48:27Z","timestamp":1595238507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3125-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,2]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["3125"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3125-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,2]]},"assertion":[{"value":"2 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}