{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T15:43:22Z","timestamp":1769355802066,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,9,20]],"date-time":"2014-09-20T00:00:00Z","timestamp":1411171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s11590-014-0787-x","type":"journal-article","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T17:55:48Z","timestamp":1411149348000},"page":"799-817","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results"],"prefix":"10.1007","volume":"9","author":[{"given":"Effrosyni","family":"Theodorou","sequence":"first","affiliation":[]},{"given":"Ali","family":"Diabat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,20]]},"reference":[{"key":"787_CR1","unstructured":"Theodorou, E., Diabat, A., Svetinovic, D.: Quay crane sequencing considering productivity, interference and yard congestion constraints. In: IEEE Industrial Engineering and Engineering Management, pp. 1\u20135 (2012)"},{"key":"787_CR2","doi-asserted-by":"crossref","unstructured":"Simrin, A., Diabat, A.: The dynamic berth allocation problem: a linearized formulation. RAIRO-Oper. Res. doi: 10.1051\/ro\/2014039 (2014) (in press)","DOI":"10.1051\/ro\/2014039"},{"issue":"1","key":"787_CR3","first-page":"45","volume":"53","author":"F Meisel","year":"2011","unstructured":"Meisel, F.: The quay crane scheduling problem with time windows. Nav. Res. Logist. 53(1), 45\u201359 (2011)","journal-title":"Nav. Res. Logist."},{"key":"787_CR4","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.: An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 73, 115\u2013123 (2014)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"787_CR5","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.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3), 615\u2013627 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"787_CR6","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"KH Kim","year":"2004","unstructured":"Kim, K.H., Park, Y.-M.: A crane scheduling method for port container terminals. Eur. J. Oper. Res. 156(3), 752\u2013768 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"787_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10951-009-0105-0","volume":"2009","author":"C Bierwirth","year":"2009","unstructured":"Bierwirth, C., Meisel, F.: A fast heuristic for quay crane scheduling with interference constraints. J. Sched. 2009(12), 345\u2013360 (2009)","journal-title":"J. Sched."},{"issue":"1","key":"787_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.20117","volume":"53","author":"L Moccia","year":"2006","unstructured":"Moccia, L., Cordeau, J.: A branch- $$\\cdot $$ \u00b7 and- $$\\cdot $$ \u00b7 cut algorithm for the quay crane scheduling problem in a container terminal. Nav. Res. 53(1), 1\u201337 (2006)","journal-title":"Nav. Res."},{"issue":"2","key":"787_CR9","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.: A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp. Sci. 47(2), 131\u2013147 (2013)","journal-title":"Transp. Sci."},{"issue":"1","key":"787_CR10","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/trsc.1090.0296","volume":"44","author":"S Choo","year":"2009","unstructured":"Choo, S., Klabjan, D., Simchi-Levi, D.: Multiship crane sequencing with yard congestion constraints. Transp. Sci. 44(1), 98\u2013115 (2009)","journal-title":"Transp. Sci."},{"issue":"1","key":"787_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.cie.2008.05.011","volume":"56","author":"R Tavakkoli-Moghaddam","year":"2009","unstructured":"Tavakkoli-Moghaddam, R., Makui, a, Salahi, S., Bazzazi, M., Taheri, F.: An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Comput. Ind. Eng. 56(1), 241\u2013248 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"15","key":"787_CR12","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.: A multi-vessel quay crane assignment and scheduling problem: formulation and heuristic solution approach. Expert Syst. Appl. 41(15), 6959\u20136965 (2014)","journal-title":"Expert Syst. Appl."},{"key":"787_CR13","doi-asserted-by":"crossref","unstructured":"Diabat, A., Fu, Y.-M.: A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl. Math. Model. (2014) In press. doi: 10.1016\/j.apm.2014.07.006","DOI":"10.1016\/j.apm.2014.07.006"},{"issue":"3","key":"787_CR14","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1016\/j.cie.2008.09.008","volume":"56","author":"H Zhang","year":"2009","unstructured":"Zhang, H., Kim, K.H.: Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput. Ind. Eng. 56(3), 979\u2013992 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"787_CR15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","volume":"23","author":"CF Daganzo","year":"1989","unstructured":"Daganzo, C.F.: The crane scheduling problem. Transp. Res. Part B Methodol. 23(3), 159\u2013175 (1989)","journal-title":"Transp. Res. Part B Methodol."},{"key":"787_CR16","first-page":"461","volume":"4293","author":"Y Park","year":"2006","unstructured":"Park, Y., Lee, B., Kim, K., Ryu, K.: A quay crane scheduling method considering interference of yard cranes in container terminals. MICAI Adv. Artif. 4293, 461\u2013471 (2006)","journal-title":"MICAI Adv. Artif."},{"issue":"1","key":"787_CR17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10479-010-0765-3","volume":"203","author":"Y Guan","year":"2010","unstructured":"Guan, Y., Yang, K.-H., Zhou, Z.: The crane scheduling problem: models and solution approaches. Ann. Oper. Res. 203(1), 119\u2013139 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"787_CR18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1002\/nav.20108","volume":"53","author":"J Liu","year":"2006","unstructured":"Liu, J., Wan, Y., Wang, L.: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav. Res. Logist. 53(1), 60\u201374 (2006)","journal-title":"Nav. Res. Logist."},{"issue":"2","key":"787_CR19","first-page":"10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher, M.L.: An applications oriented guide to Lagrangian relaxation. INFORMS J. Pract. Oper. Res. 15(2), 10\u201321 (1985)","journal-title":"INFORMS J. Pract. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0787-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0787-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0787-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:39Z","timestamp":1559409099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0787-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,20]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["787"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0787-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,20]]}}}