{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:08:14Z","timestamp":1777597694056,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T00:00:00Z","timestamp":1365638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10288-013-0235-2","type":"journal-article","created":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T08:46:49Z","timestamp":1365583609000},"page":"123-156","source":"Crossref","is-referenced-by-count":22,"title":["A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules"],"prefix":"10.1007","volume":"12","author":[{"given":"Pasquale","family":"Legato","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Trunfio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,11]]},"reference":[{"key":"235_CR1","doi-asserted-by":"crossref","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:345\u2013360","journal-title":"J Sched"},{"issue":"3","key":"235_CR2","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. Eur J Oper Res 202(3):615\u2013627","journal-title":"Eur J Oper Res"},{"issue":"3","key":"235_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","volume":"23","author":"C Daganzo","year":"1989","unstructured":"Daganzo C (1989) The crane scheduling problem. Transp Res B 23(3):159\u2013175","journal-title":"Transp Res B"},{"key":"235_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7:181\u2013200","journal-title":"ORSA J Comput"},{"issue":"1\u20133","key":"235_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Prog B 98(1\u20133):23\u201347","journal-title":"Math Prog B"},{"key":"235_CR6","doi-asserted-by":"crossref","unstructured":"Guan Y, Yang KH, Zhou Z (2010) The crane scheduling problem: models and solution approaches. Ann Oper Res 203(1):119\u2013139","DOI":"10.1007\/s10479-010-0765-3"},{"key":"235_CR7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1111\/j.1475-3995.2006.00562.x","volume":"13","author":"M Haouari","year":"2006","unstructured":"Haouari M, Gharbi A, Jemmali M (2006) Tight bounds for the identical parallel machine scheduling problem. Int Trans Oper Res 13:529\u2013548","journal-title":"Int Trans Oper Res"},{"key":"235_CR8","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"K Kim","year":"2004","unstructured":"Kim K, Park Y (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156:752\u2013768","journal-title":"Eur J Oper Res"},{"issue":"1","key":"235_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/03052150902943020","volume":"42","author":"D Lee","year":"2010","unstructured":"Lee D, Chen J (2010) An improved approach for quay crane scheduling with non-crossing constraints. Eng Optimiz 42(1):1\u201315","journal-title":"Eng Optimiz"},{"issue":"1","key":"235_CR10","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.tre.2006.08.001","volume":"44","author":"DH Lee","year":"2008","unstructured":"Lee DH, Wang HQ, Miao L (2008) Quay crane scheduling with non-interference constraints in port container terminals. Transp Res E 44(1):124\u2013135","journal-title":"Transp Res E"},{"issue":"3","key":"235_CR11","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s00291-010-0207-2","volume":"32","author":"P Legato","year":"2010","unstructured":"Legato P, Mazza R, Trunfio R (2010) Simulation-based optimization for discharge\/loading operations at a maritime container terminal. OR Spect 32(3):543\u2013567","journal-title":"OR Spect"},{"key":"235_CR12","doi-asserted-by":"crossref","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:2063\u20132078","journal-title":"Comput Oper Res"},{"issue":"3","key":"235_CR13","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1002\/nav.10123","volume":"51","author":"A Lim","year":"2004","unstructured":"Lim A, Rodrigues B, Xiao F, Zhu Y (2004) Crane scheduling with spatial constraints. Nav Res Log 51(3):386\u2013406","journal-title":"Nav Res Log"},{"issue":"2","key":"235_CR14","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. Nav Res Log 54(2):115\u2013127","journal-title":"Nav Res Log"},{"issue":"1","key":"235_CR15","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1002\/nav.20108","volume":"53","author":"J Liu","year":"2006","unstructured":"Liu J, Wan YW, Wang L (2006) Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav Res Log 53(1):60\u201374","journal-title":"Nav Res Log"},{"key":"235_CR16","doi-asserted-by":"crossref","unstructured":"Meisel F (2011) The quay crane scheduling problem with time windows. Nav Res Log 58(7):619\u2013636","DOI":"10.1002\/nav.20471"},{"issue":"3","key":"235_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. Comput Oper Res 38(3):683\u2013693","journal-title":"Comput Oper Res"},{"key":"235_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/nav.20121","volume":"53","author":"L Moccia","year":"2006","unstructured":"Moccia L, Cordeau JF, Gaudioso M, Laporte G (2006) A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Nav Res Log 53:45\u201359","journal-title":"Nav Res Log"},{"issue":"4","key":"235_CR19","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1504\/IJSTL.2011.041137","volume":"3","author":"M Monaco","year":"2011","unstructured":"Monaco M, Sammarra M (2011) Quay crane scheduling with time windows, one-way and spatial constraints. Int J Shipp Transp Logist 3(4):454\u2013474","journal-title":"Int J Shipp Transp Logist"},{"issue":"6","key":"235_CR20","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1080\/03052150600691038","volume":"38","author":"WC Ng","year":"2006","unstructured":"Ng WC, Mak KL (2006) Quay crane scheduling in container terminals. Eng Opt 38(6):723\u2013737","journal-title":"Eng Opt"},{"issue":"1","key":"235_CR21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(90)90014-P","volume":"24","author":"R Peterkofsky","year":"1990","unstructured":"Peterkofsky R, Daganzo C (1990) Branch-and-bound solution method for the crane scheduling problem. Transp Res B 24(1):159\u2013172","journal-title":"Transp Res B"},{"key":"235_CR22","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10951-007-0029-5","volume":"10","author":"M Sammarra","year":"2007","unstructured":"Sammarra M, Cordeau JF, Laporte G, Monaco MF (2007) A tabu search heuristic for the quay crane scheduling problem. J Sched 10:327\u2013336","journal-title":"J Sched"},{"key":"235_CR23","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 Spect 30:1\u201352","journal-title":"OR Spect"},{"issue":"12","key":"235_CR24","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. J Oper Res Soc 57(12):1464\u20131471","journal-title":"J Oper Res Soc"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0235-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-013-0235-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0235-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:58Z","timestamp":1559131978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-013-0235-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,11]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["235"],"URL":"https:\/\/doi.org\/10.1007\/s10288-013-0235-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,11]]}}}