{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:56:38Z","timestamp":1752674198680,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T00:00:00Z","timestamp":1485993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61221063"],"award-info":[{"award-number":["61221063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for Changjiang Scholars and Innovative Research Team in University","award":["IRT1173"],"award-info":[{"award-number":["IRT1173"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2015781040"],"award-info":[{"award-number":["2015781040"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10878-017-0113-5","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T09:49:45Z","timestamp":1486028985000},"page":"617-636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead"],"prefix":"10.1007","volume":"36","author":[{"given":"Jiayin","family":"Pan","sequence":"first","affiliation":[]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Guiqing","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,2]]},"reference":[{"issue":"3","key":"113_CR1","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"},{"key":"113_CR2","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1057\/jors.2010.54","volume":"62","author":"J Blazewicz","year":"2011","unstructured":"Blazewicz J, Cheng TCE, Machowiak M, Oguz C (2011) Berth and quay crane allocation: a moldable task scheduling model. J Oper Res Soc 62:1189\u20131197","journal-title":"J Oper Res Soc"},{"key":"113_CR3","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, New York"},{"key":"113_CR4","first-page":"1","volume":"27","author":"H Carlo","year":"2013","unstructured":"Carlo H, Vis I, Roodbergen K (2013) Seaside operations in container terminals: literature overview, trends, and research directions. Flex Serv Manuf J 27:1\u201339","journal-title":"Flex Serv Manuf J"},{"key":"113_CR5","doi-asserted-by":"crossref","unstructured":"Chen JH, Lee DH, Cao JX (2012) A combinatorial benders cuts algorithm for the quayside operation problem at container terminals. Transp Res Part E Logist Transp Rev 48(1):266\u2013275 (2012) (select Papers from the 19th International Symposium on Transportation and Traffic Theory)","DOI":"10.1016\/j.tre.2011.06.004"},{"issue":"2","key":"113_CR6","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.trb.2009.07.003","volume":"44","author":"G Giallombardo","year":"2010","unstructured":"Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transp Res Part B Methodol 44(2):232\u2013245","journal-title":"Transp Res Part B Methodol"},{"issue":"3","key":"113_CR7","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. Transp Res Part B Methodol 39(3):199\u2013221","journal-title":"Transp Res Part B Methodol"},{"issue":"3","key":"113_CR8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10845-009-0304-8","volume":"22","author":"C Liang","year":"2011","unstructured":"Liang C, Guo J, Yang Y (2011) Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning. J Intell Manuf 22(3):471\u2013479","journal-title":"J Intell Manuf"},{"issue":"3","key":"113_CR9","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/j.ejor.2005.12.016","volume":"177","author":"P Lokuge","year":"2007","unstructured":"Lokuge P, Alahakoon D (2007) Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents. Eur J Oper Res 177(3):1985\u20132015","journal-title":"Eur J Oper Res"},{"issue":"4","key":"113_CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10951-010-0192-y","volume":"14","author":"M Mandelbaum","year":"2011","unstructured":"Mandelbaum M, Shabtay D (2011) Scheduling unit length jobs on parallel machines with lookahead information. J Sched 14(4):335\u2013350","journal-title":"J Sched"},{"issue":"1","key":"113_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-002-0109-z","volume":"25","author":"YM Park","year":"2003","unstructured":"Park YM, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectr 25(1):1\u201323","journal-title":"OR Spectr"},{"key":"113_CR12","unstructured":"Theofannis S, Golias M, Boile M (2007) Berth and quay crane scheduling: a formulation reflecting service deadlines and productivity agreements. In: Proceedings of the international conference on transport science and technology (TRANSTEC 2007), Prague, pp 124\u2013140"},{"issue":"5","key":"113_CR13","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.orl.2008.04.005","volume":"36","author":"L Zhang","year":"2008","unstructured":"Zhang L, Khammuang K, Wirth A (2008) On-line scheduling with non-crossing constraints. Oper Res Lett 36(5):579\u2013583","journal-title":"Oper Res Lett"},{"key":"113_CR14","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ipl.2007.10.008","volume":"106","author":"F Zheng","year":"2008","unstructured":"Zheng F, Xu Y, Zhang E (2008) How much can lookahead help in online single machine scheduling. Inf Pro Lett 106:70\u201374","journal-title":"Inf Pro Lett"},{"key":"113_CR15","doi-asserted-by":"crossref","unstructured":"Zheng F, Qiao L, Liu M (2015) An Online Model of Berth and Quay Crane Integrated Allocation in Container Terminals. In: Lu Z, Kim D, Wu W, Li W, Du DZ (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science, vol 9486. Springer, Cham, pp 721\u2013730","DOI":"10.1007\/978-3-319-26626-8_53"},{"issue":"4","key":"113_CR16","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/trsc.1100.0364","volume":"45","author":"L Zhen","year":"2011","unstructured":"Zhen L, Chew EP, Lee LH (2011) An integrated model for berth template and yard template planning in transshipment hubs. Transp Sci 45(4):483\u2013504","journal-title":"Transp Sci"},{"issue":"1","key":"113_CR17","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.cor.2012.06.003","volume":"40","author":"F Zheng","year":"2013","unstructured":"Zheng F, Cheng Y, Liu M, Xu Y (2013) Online interval scheduling on a single machine with finite lookahead. Comput Oper Res 40(1):180\u2013191","journal-title":"Comput Oper Res"},{"key":"113_CR18","unstructured":"Zheng F, Qiao L, Liu M, Chu C. Online integrated allocation for small numbers of berths and quay cranes in container terminals, private communication"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0113-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0113-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0113-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T08:29:10Z","timestamp":1529569750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0113-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["113"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0113-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,2,2]]}}}