{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:42:43Z","timestamp":1760730163814},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,6,17]],"date-time":"2010-06-17T00:00:00Z","timestamp":1276732800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10479-010-0765-3","type":"journal-article","created":{"date-parts":[[2010,6,16]],"date-time":"2010-06-16T16:11:39Z","timestamp":1276704699000},"page":"119-139","source":"Crossref","is-referenced-by-count":46,"title":["The crane scheduling problem: models and solution approaches"],"prefix":"10.1007","volume":"203","author":[{"given":"Yongpei","family":"Guan","sequence":"first","affiliation":[]},{"given":"Kang-Hung","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Zhili","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,6,17]]},"reference":[{"key":"765_CR1","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"J. F. Cordeau","year":"2005","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.","journal-title":"Transportation Science"},{"issue":"3","key":"765_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","volume":"23","author":"C. F. Daganzo","year":"1989","unstructured":"Daganzo, C. F. (1989). The crane scheduling problem. Transportation Research B, 23(3), 159\u2013175.","journal-title":"Transportation Research B"},{"key":"765_CR3","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","volume":"191","author":"P. Hansen","year":"2008","unstructured":"Hansen, P., Oguz, C., & Mladenovic, N. (2008). Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research, 191, 636\u2013649.","journal-title":"European Journal of Operational Research"},{"key":"765_CR4","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 B, 39, 199\u2013221.","journal-title":"Transportation Research B"},{"key":"765_CR5","unstructured":"Kalvelagen, E. (2002). Lagrangian relaxation with GAMS. Tech. rep., GAMS Development Corp."},{"key":"765_CR6","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"K. H. Kim","year":"2004","unstructured":"Kim, K. H., & Park, Y. M. (2004). A crane scheduling method for port containers. European Journal of Operational Research, 156, 752\u2013768.","journal-title":"European Journal of Operational Research"},{"key":"765_CR7","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.tre.2006.08.001","volume":"44","author":"D. H. Lee","year":"2008","unstructured":"Lee, D. H., Wang, H. Q., & Miao, L. (2008). Quay crane scheduling with non-interference constraints in port container terminals. Transportation Research E, 44, 124\u2013135.","journal-title":"Transportation Research E"},{"key":"765_CR8","doi-asserted-by":"crossref","unstructured":"Lim, A., Rodrigues, B., Xiao, F., & Zhu, Y. (2002). Crane scheduling using tabu search. In Proceedings of the 14th IEEE international conference on tools with artificial intelligence.","DOI":"10.1109\/TAI.2002.1180799"},{"key":"765_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/nav.20189","volume":"54","author":"A. Lim","year":"2007","unstructured":"Lim, A., Rodrigues, B., & Xu, Z. (2007). A m-parallel crane scheduling problem with a non-crossing constraint. Naval Research Logistics, 54, 115\u2013127.","journal-title":"Naval Research Logistics"},{"key":"765_CR10","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1002\/nav.20108","volume":"53","author":"J. Liu","year":"2005","unstructured":"Liu, J., Wan, Y., & Wang, L. (2005). Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Naval Research Logistics, 53, 60\u201374.","journal-title":"Naval Research Logistics"},{"key":"765_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/nav.20121","volume":"53","author":"L. Moccia","year":"2006","unstructured":"Moccia, L., Cordeau, J., Gaudioso, M., & Laporte, G. (2006). A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics, 53, 45\u201359.","journal-title":"Naval Research Logistics"},{"issue":"2","key":"765_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1287\/trsc.1060.0171","volume":"41","author":"M. F. Monaco","year":"2007","unstructured":"Monaco, M. F., & Sammarra, M. (2007). The berth allocation problem: A strong formulation solved by a lagrangean approach. Transportation Science, 41(2), 265\u2013280.","journal-title":"Transportation Science"},{"issue":"3","key":"765_CR13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(90)90014-P","volume":"24","author":"R. I. Peterkofsky","year":"1990","unstructured":"Peterkofsky, R. I., & Daganzo, C. F. (1990). A branch and bound solution method for the crane scheduling problem. Transportation Research B, 24(3), 159\u2013172.","journal-title":"Transportation Research B"},{"key":"765_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-007-0100-9","volume":"30","author":"R. Stahlbock","year":"2008","unstructured":"Stahlbock, R., & Vo\u00df, S. (2008). Operations research at container terminals: a literature update. OR Spectrum, 30, 1\u201352.","journal-title":"OR Spectrum"},{"key":"765_CR15","unstructured":"UN (2005). Regional shipping and port development strategies (Container Traffic Forecast). United Nations."},{"key":"765_CR16","doi-asserted-by":"crossref","first-page":"2186","DOI":"10.1016\/j.dss.2006.06.008","volume":"42","author":"F. Wang","year":"2007","unstructured":"Wang, F., & Lim, A. (2007). A stochastic beam search for the berth allocation problem. Decision Support Systems, 42, 2186\u20132196.","journal-title":"Decision Support Systems"},{"issue":"12","key":"765_CR17","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. Journal of the Operational Research Society, 57(12), 1464\u20131471.","journal-title":"Journal of the Operational Research Society"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0765-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0765-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0765-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T04:47:56Z","timestamp":1559191676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0765-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,17]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["765"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0765-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,17]]}}}