{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T08:24:41Z","timestamp":1768465481096,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"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 Comb Optim"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10878-019-00508-9","type":"journal-article","created":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T02:02:21Z","timestamp":1576202541000},"page":"708-724","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles"],"prefix":"10.1007","volume":"39","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaxin","family":"Pang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3190-5008","authenticated-orcid":false,"given":"Ming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,13]]},"reference":[{"key":"508_CR1","unstructured":"Bauer M (2016) Entwurf und experimentelle Analyse von L\u00f6sungsverfahren f\u00fcr das Container Sequencing Problem, Ph.D. Dissertation, Universit\u00e4t Passau, pp 88\u2013132"},{"issue":"4","key":"508_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10951-009-0105-0","volume":"12","author":"C Bierwirth","year":"2009","unstructured":"Bierwirth C, Meisel F (2009) A fast heuristic for quay crane scheduling with interference constraints. J Sched 12(4):345\u2013360","journal-title":"J Sched"},{"issue":"3","key":"508_CR3","doi-asserted-by":"publisher","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. Eur J Oper Res 202(3):615\u2013627","journal-title":"Eur J Oper Res"},{"issue":"3","key":"508_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 (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 244(3):675\u2013689","journal-title":"Eur J Oper Res"},{"issue":"2","key":"508_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s10696-013-9178-3","volume":"272","author":"HJ Carlo","year":"2015","unstructured":"Carlo HJ, Vis IFA, Roodbergen KJ (2015) Seaside operations in container terminals: literature overview, trends, and research directions. Flex Serv Manuf J 272(2):224\u2013262","journal-title":"Flex Serv Manuf J"},{"key":"508_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-1-4419-8408-1_13","volume-title":"Handbook of terminal planning","author":"M Caserta","year":"2011","unstructured":"Caserta M, Schwarze S, Vo\u00df S (2011) Container rehandling at maritime container terminals. In: Bose JW (ed) Handbook of terminal planning. Springer, Berlin, pp 247\u2013269"},{"issue":"1","key":"508_CR7","doi-asserted-by":"publisher","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. Transp Sci 44(1):98\u2013115","journal-title":"Transp Sci"},{"key":"508_CR8","first-page":"1","volume":"1251","author":"CF Daganzo","year":"1989","unstructured":"Daganzo CF (1989) Crane productivity and ship delay in ports. Transp Res Rec 1251:1\u20139","journal-title":"Transp Res Rec"},{"issue":"4","key":"508_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/trsc.1060.0148","volume":"40","author":"AV Goodchild","year":"2006","unstructured":"Goodchild AV, Daganzo CF (2006) Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transp Sci 40(4):473\u2013483","journal-title":"Transp Sci"},{"key":"508_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Q 1:61\u201368","journal-title":"Naval Res Logist Q"},{"issue":"4","key":"508_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0360-8352(97)00010-7","volume":"32","author":"KH Kim","year":"1997","unstructured":"Kim KH (1997) Evaluation of the number of rehandles in container yards. Comput Ind Eng 32(4):701\u2013711","journal-title":"Comput Ind Eng"},{"issue":"4","key":"508_CR12","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"KH Kim","year":"2006","unstructured":"Kim KH, Hong G-P (2006) A heuristic rule for relocating blocks. Comput Oper Res 33(4):940\u2013954","journal-title":"Comput Oper Res"},{"issue":"3","key":"508_CR13","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"KH Kim","year":"2004","unstructured":"Kim KH, Park Y-M (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156(3):752\u2013768","journal-title":"Eur J Oper Res"},{"issue":"4","key":"508_CR14","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1287\/trsc.2014.0563","volume":"49","author":"CY Lee","year":"2015","unstructured":"Lee CY, Liu M, Chu CB (2015) Optimal algorithm for general quay crane double-cycling problem. Transp Sci 49(4):957\u2013967","journal-title":"Transp Sci"},{"issue":"9","key":"508_CR15","doi-asserted-by":"publisher","first-page":"2063","DOI":"10.1016\/j.cor.2011.09.025","volume":"39","author":"P Legato","year":"2012","unstructured":"Legato P, Trunfio R, Meisel F (2012) Modeling and solving rich quay crane scheduling problems. Comput Oper Res 39(9):2063\u20132078","journal-title":"Comput Oper Res"},{"issue":"2","key":"508_CR16","doi-asserted-by":"publisher","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 Res Logist 54(2):115\u2013127","journal-title":"Naval Res Logist"},{"key":"508_CR17","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tre.2015.06.009","volume":"81","author":"M Liu","year":"2015","unstructured":"Liu M, Chu F, Zhang ZZ, Chu CB (2015a) A polynomial-time heuristic for the quay crane double-cycling problem with internal-reshuffling operations. Transp Res Part E 81:52\u201374","journal-title":"Transp Res Part E"},{"issue":"2","key":"508_CR18","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s11590-014-0756-4","volume":"9","author":"M Liu","year":"2015","unstructured":"Liu M, Zheng FF, Li JF (2015b) Scheduling small number of quay cranes with non-interference constraint. Optim Lett 9(2):403\u2013412","journal-title":"Optim Lett"},{"issue":"7","key":"508_CR19","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1002\/nav.20471","volume":"58","author":"F Meisel","year":"2011","unstructured":"Meisel F (2011) The quay crane scheduling problem with time windows. Naval Res Logist 58(7):619\u2013639","journal-title":"Naval Res Logist"},{"issue":"3","key":"508_CR20","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s00291-009-0191-6","volume":"32","author":"F Meisel","year":"2010","unstructured":"Meisel F, Wichmann M (2010) Container sequencing for quay cranes with internal reshuffles. OR Spectr 32(3):569\u2013591","journal-title":"OR Spectr"},{"issue":"3","key":"508_CR21","doi-asserted-by":"publisher","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. Comput Oper Res 38(3):683\u2013693","journal-title":"Comput Oper Res"},{"issue":"2","key":"508_CR22","doi-asserted-by":"publisher","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. Transp Sci 47(2):131\u2013147","journal-title":"Transp Sci"},{"issue":"1","key":"508_CR23","doi-asserted-by":"publisher","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 Spectr 30(1):1\u201352","journal-title":"OR Spectr"},{"issue":"3","key":"508_CR24","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1016\/j.cie.2008.09.008","volume":"56","author":"HP Zhang","year":"2009","unstructured":"Zhang HP, Kim KH (2009) Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput Ind Eng 56(3):979\u2013992","journal-title":"Comput Ind Eng"},{"issue":"3","key":"508_CR25","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.ejor.2016.10.021","volume":"258","author":"A Zhang","year":"2017","unstructured":"Zhang A, Zhang WS, Chen Y, Chen GT, Chen XF (2017) Approximate the scheduling of quay cranes with non-crossing constraints. Eur J Oper Res 258(3):820\u2013828","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00508-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00508-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00508-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T00:22:52Z","timestamp":1607732572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00508-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,13]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["508"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00508-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,13]]},"assertion":[{"value":"13 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}