{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T08:04:04Z","timestamp":1776931444246,"version":"3.51.2"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T00:00:00Z","timestamp":1487203200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10951-017-0510-8","type":"journal-article","created":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T06:18:21Z","timestamp":1487225901000},"page":"459-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Mathematical models for the berth allocation problem in dry bulk terminals"],"prefix":"10.1007","volume":"20","author":[{"given":"Andreas T.","family":"Ernst","sequence":"first","affiliation":[]},{"given":"Ceyda","family":"O\u011fuz","sequence":"additional","affiliation":[]},{"given":"Gaurav","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Gita","family":"Taherkhani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"510_CR1","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1016\/j.cor.2012.10.020","volume":"40","author":"A Abdekhodaee","year":"2013","unstructured":"Abdekhodaee, A., & Wirth, W. (2013). Off-line scheduling with forbidden zones. Computers & Operations Research, 40, 1034\u20131037.","journal-title":"Computers & Operations Research"},{"key":"510_CR2","doi-asserted-by":"crossref","first-page":"2991","DOI":"10.1016\/j.cor.2012.03.003","volume":"39","author":"Y Arahori","year":"2012","unstructured":"Arahori, Y., Imamichi, T., & Nagamochi, H. (2012). An exact strip packing algorithm based on canonical forms. Computers & Operations Research, 39, 2991\u20133011.","journal-title":"Computers & Operations Research"},{"key":"510_CR3","doi-asserted-by":"crossref","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. M., & Lorena, L. A. N. (2011). Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering, 60, 606\u2013613.","journal-title":"Computers & Industrial Engineering"},{"key":"510_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ejor.2011.06.001","volume":"215","author":"PM Castro","year":"2011","unstructured":"Castro, P. M., & Oliveira, J. F. (2011). Scheduling inspired models for two-dimensional packing problems. European Journal of Operational Research, 215, 45\u201356.","journal-title":"European Journal of Operational Research"},{"key":"510_CR5","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39, 526\u2013538.","DOI":"10.1287\/trsc.1050.0120"},{"key":"510_CR6","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1287\/trsc.2014.0568","volume":"49","author":"Y Du","year":"2015","unstructured":"Du, Y., Chen, Q., Lam, J. S. L., Xu, Y., & Cao, J. X. (2015). Modeling the impacts of tides and the virtual arrival policy in berth allocation. Transportation Science, 49, 939\u2013956.","journal-title":"Transportation Science"},{"key":"510_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00291-003-0140-8","volume":"26","author":"Y Guan","year":"2004","unstructured":"Guan, Y., & Cheung, R. K. (2004). The berth allocation problem: Models and solution methods. OR Spectrum, 26, 75\u201392.","journal-title":"OR Spectrum"},{"key":"510_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-6377(02)00147-5","volume":"30","author":"Y Guan","year":"2002","unstructured":"Guan, Y., Xiao, W. Q., Cheung, R. K., & Li, C. L. (2002). A multiprocessor task scheduling model for berth allocation: Heuristic and worst case analysis. Operations Research Letters, 30, 343\u2013350.","journal-title":"Operations Research Letters"},{"issue":"5","key":"510_CR9","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1016\/j.cor.2011.05.022","volume":"39","author":"M Haouari","year":"2012","unstructured":"Haouari, M., Kooli, A., & N\u00e9ron, E. (2012). Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem. Computers & Operations Research, 39(5), 1187\u20131194.","journal-title":"Computers & Operations Research"},{"key":"510_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.trb.2004.04.004","volume":"39","author":"A Imai","year":"2005","unstructured":"Imai, A., Sun, X., Nishimura, E., & Papadimitriou, S. (2005). Berth allocation in a container port: Using a continuous location space approach. Transportation Research Part B, 39, 199\u2013221.","journal-title":"Transportation Research Part B"},{"key":"510_CR11","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/S0191-2615(02)00027-9","volume":"37","author":"KH Kim","year":"2003","unstructured":"Kim, K. H., & Moon, K. C. (2003). Berth scheduling by simulated annealing. Transportation Research Part B, 37, 541\u2013560.","journal-title":"Transportation Research Part B"},{"key":"510_CR12","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/j.tre.2010.01.009","volume":"46","author":"D-H Lee","year":"2010","unstructured":"Lee, D.-H., Chen, J. H., & Cao, J. X. (2010). The continuous berth allocation problem: A greedy randomized adaptive search solution. Transportation Research Part E, 46, 1017\u20131029.","journal-title":"Transportation Research Part E"},{"key":"510_CR13","first-page":"433","volume":"30","author":"CL Li","year":"1998","unstructured":"Li, C. L., Cai, X. Q., & Lee, C. Y. (1998). Scheduling with multiple-job-on-one processor pattern. IIE Transactions, 30, 433\u2013445.","journal-title":"IIE Transactions"},{"key":"510_CR14","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. Operations Research Letters, 22, 105\u2013110.","journal-title":"Operations Research Letters"},{"key":"510_CR15","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(00)00128-4","volume":"131","author":"E Nishimura","year":"2001","unstructured":"Nishimura, E., Imai, A., & Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, 131, 282\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"510_CR16","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1051\/ro\/2014049","volume":"49","author":"G Singh","year":"2015","unstructured":"Singh, G., Ernst, A. T., Baxter, M., & Sier, D. (2015). Rail schedule optimisation in The Hunter Valley Coal Chain. RAIRO-Operationas Research, 49, 413\u2013434.","journal-title":"RAIRO-Operationas Research"},{"key":"510_CR17","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.ejor.2012.01.012","volume":"220","author":"G Singh","year":"2011","unstructured":"Singh, G., Sier, D., Ernst, A. T., Gavriliouk, O., Oyston, R., Giles, T., et al. (2011). A mixed integer programming model for long term capacity expansion planning: A case study from The Hunter Valley Coal Chain. European Journal of Operational Research, 220, 210\u2013224.","journal-title":"European Journal of Operational Research"},{"key":"510_CR18","doi-asserted-by":"crossref","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. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E, 54, 14\u201331.","journal-title":"Transportation Research Part E"},{"key":"510_CR19","doi-asserted-by":"crossref","unstructured":"UNCTAD. (2015). Review of maritime transport. United Nations Conference on Trade and Development. \n                        http:\/\/unctad.org\/en\/PublicationsLibrary\/rmt2015_en\n                        \n                    .","DOI":"10.18356\/e9299843-en"},{"key":"510_CR20","doi-asserted-by":"crossref","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. (2012). Berth allocation with time-dependent physical limitations on vessels. European Journal of Operational Research, 216, 47\u201356.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0510-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0510-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0510-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T09:59:48Z","timestamp":1506506388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0510-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,16]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["510"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0510-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,16]]}}}