{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T13:01:43Z","timestamp":1783515703422,"version":"3.55.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T00:00:00Z","timestamp":1465171200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10479-016-2239-8","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T19:19:17Z","timestamp":1465240757000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints"],"prefix":"10.1007","volume":"248","author":[{"given":"Noura","family":"Al-Dhaheri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Diabat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,6,6]]},"reference":[{"key":"2239_CR1","doi-asserted-by":"crossref","unstructured":"Alzaabi, S. A. J., & Diabat, A. (2016). On the berth allocation problem. RAIRO-Operations Research, 50(3), 491\u2013501.","DOI":"10.1051\/ro\/2015029"},{"key":"2239_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.jmsy.2015.02.010","volume":"36","author":"N Al-Dhaheri","year":"2015","unstructured":"Al-Dhaheri, N., & Diabat, A. (2015). The quay crane scheduling problem. Journal of Manufacturing Systems, 36, 87\u201394.","journal-title":"Journal of Manufacturing Systems"},{"key":"2239_CR3","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.simpat.2016.01.009","volume":"66","author":"N Al-Dhaheri","year":"2016","unstructured":"Al-Dhaheri, N., Jebali, A., & Diabat, A. (2016a). A simulation based genetic algorithm approach for the quay crane scheduling under uncertainty. Simulation Modelling Practice and Theory, 66, 122\u2013138.","journal-title":"Simulation Modelling Practice and Theory"},{"key":"2239_CR4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.cie.2016.01.011","volume":"94","author":"N Al-Dhaheri","year":"2016","unstructured":"Al-Dhaheri, N., Jebali, A., & Diabat, A. (2016b). The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints. Computers and Industrial Engineering, 94, 230\u2013244.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"2239_CR5","doi-asserted-by":"crossref","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. European Journal of Operational Research, 244(3), 675\u2013689.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"2239_CR6","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/nav.21512","volume":"59","author":"N Boysen","year":"2012","unstructured":"Boysen, N., Emde, S., & Fliedner, M. (2012). Determining crane areas for balancing workload among interfering and noninterfering cranes. Naval Research Logistics (NRL), 59(8), 656\u2013662.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"4","key":"2239_CR7","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/S1007-0214(10)70089-4","volume":"15","author":"J Cao","year":"2010","unstructured":"Cao, J., Shi, Q., & Lee, D.-H. (2010). Integrated quay crane and yard truck schedule problem in container terminals. Tsinghua Science and Technology, 15(4), 467\u2013474.","journal-title":"Tsinghua Science and Technology"},{"issue":"6","key":"2239_CR8","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1016\/j.tre.2011.04.004","volume":"47","author":"JH Chen","year":"2011","unstructured":"Chen, J. H., Lee, D.-H., & Cao, J. X. (2011). Heuristics for quay crane scheduling at indented berth. Transportation Research Part E: Logistics and Transportation Review, 47(6), 1005\u20131020.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"2239_CR9","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.ejor.2013.06.051","volume":"232","author":"JH Chen","year":"2014","unstructured":"Chen, J. H., Lee, D.-H., & Goh, M. (2014). An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem. European Journal of Operational Research, 232(1), 198\u2013208.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2239_CR10","doi-asserted-by":"crossref","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. Transportation Science, 44(1), 98\u2013115.","journal-title":"Transportation Science"},{"issue":"16","key":"2239_CR11","doi-asserted-by":"crossref","first-page":"4820","DOI":"10.1080\/00207543.2013.774489","volume":"51","author":"SH Chung","year":"2013","unstructured":"Chung, S. H., & Chan, F. T. S. (2013). A workload balancing genetic algorithm for the quay crane scheduling problem. International Journal of Production Research, 51(16), 4820\u20134834.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"2239_CR12","doi-asserted-by":"crossref","first-page":"4213","DOI":"10.1016\/j.eswa.2011.09.113","volume":"39","author":"SH Chung","year":"2012","unstructured":"Chung, S. H., & Choy, K. L. (2012). A modified genetic algorithm for quay crane scheduling operations. Expert Systems with Applications, 39(4), 4213\u20134221.","journal-title":"Expert Systems with Applications"},{"key":"2239_CR13","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. (2014). An integrated quay crane assignment and scheduling problem. Computers and Industrial Engineering, 73, 115\u2013123.","journal-title":"Computers and Industrial Engineering"},{"key":"2239_CR14","doi-asserted-by":"crossref","unstructured":"Ding, Y., GuoLong, L., & ChengJi, L. (2012). Model and heuristic algorithm for quay crane scheduling at container terminal. In 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) (pp. 1054\u20131061).","DOI":"10.1109\/FSKD.2012.6233825"},{"issue":"10","key":"2239_CR15","doi-asserted-by":"crossref","first-page":"4063","DOI":"10.1016\/j.asoc.2013.05.006","volume":"13","author":"C Exp\u00f3sito-Izquierdo","year":"2013","unstructured":"Exp\u00f3sito-Izquierdo, C., Gonz\u00e1lez-Velarde, J. L., Meli\u00e1n-Batista, B., & Marcos Moreno-Vega, J. (2013). Hybrid estimation of distribution algorithm for the quay crane scheduling problem. Applied Soft Computing, 13(10), 4063\u20134076.","journal-title":"Applied Soft Computing"},{"issue":"1","key":"2239_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher, M. L. (1981). The Lagrangian relaxation method for solving integer programming problems. Management Science, 27(1), 1\u201318.","journal-title":"Management Science"},{"issue":"3\u20134","key":"2239_CR17","first-page":"1194","volume":"39","author":"Y-M Fu","year":"2015","unstructured":"Fu, Y.-M., & Diabat, A. (2015). A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Applied Mathematical Modelling, 39(3\u20134), 1194\u20131201.","journal-title":"Applied Mathematical Modelling"},{"issue":"15","key":"2239_CR18","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. (2014). A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach. Expert Systems with Applications, 41(15), 6959\u20136965.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"2239_CR19","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. Transportation Research Part B: Methodological, 44(2), 232\u2013245.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"2239_CR20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10479-010-0765-3","volume":"203","author":"Y Guan","year":"2013","unstructured":"Guan, Y., Yang, K.-H., & Zhou, Z. (2013). The crane scheduling problem: Models and solution approaches. Annals of Operations Research, 203(1), 119\u2013139.","journal-title":"Annals of Operations Research"},{"issue":"10","key":"2239_CR21","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1080\/0305215X.2013.844803","volume":"46","author":"P Guo","year":"2014","unstructured":"Guo, P., Cheng, W., & Wang, Y. (2014). A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints. Engineering Optimization, 46(10), 1411\u20131429.","journal-title":"Engineering Optimization"},{"issue":"4","key":"2239_CR22","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1080\/13675567.2012.741220","volume":"15","author":"MH Hakam","year":"2012","unstructured":"Hakam, M. H., Solvang, W. D., & Hammervoll, T. (2012). A genetic algorithm approach for quay crane scheduling with non-interference constraints at Narvik container terminal. International Journal of Logistics Research and Applications, 15(4), 269\u2013281.","journal-title":"International Journal of Logistics Research and Applications"},{"issue":"18","key":"2239_CR23","doi-asserted-by":"crossref","first-page":"13108","DOI":"10.1016\/j.eswa.2012.05.091","volume":"39","author":"N Kaveshgar","year":"2012","unstructured":"Kaveshgar, N., Huynh, N., & Rahimian, S. K. (2012). An efficient genetic algorithm for solving the quay crane scheduling problem. Expert Systems with Applications, 39(18), 13108\u201313117.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"2239_CR24","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. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156(3), 752\u2013768.","journal-title":"European Journal of Operational Research"},{"key":"2239_CR25","doi-asserted-by":"publisher","unstructured":"Ku, D., & Arthanari, T. S. (2014). On double cycling for container port productivity improvement. Annals of Operations Research, 1\u201316. doi: 10.1007\/s10479-014-1645-z .","DOI":"10.1007\/s10479-014-1645-z"},{"issue":"4","key":"2239_CR26","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1287\/trsc.2014.0563","volume":"49","author":"C-Y Lee","year":"2014","unstructured":"Lee, C.-Y., Liu, M., & Chu, C. (2014). Optimal algorithm for the general quay crane double-cycling problem. Transportation Science, 49(4), 957\u2013967.","journal-title":"Transportation Science"},{"issue":"8","key":"2239_CR27","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1080\/03052150903406571","volume":"42","author":"D-H Lee","year":"2010","unstructured":"Lee, D.-H., & Wang, H. Q. (2010a). Integrated discrete berth allocation and quay crane scheduling in port container terminals. Engineering Optimization, 42(8), 747\u2013761.","journal-title":"Engineering Optimization"},{"issue":"12","key":"2239_CR28","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1080\/03052151003686708","volume":"42","author":"D-H Lee","year":"2010","unstructured":"Lee, D.-H., & Wang, H. Q. (2010b). An approximation algorithm for quay crane scheduling with handling priority in port container terminals. Engineering Optimization, 42(12), 1151\u20131161.","journal-title":"Engineering Optimization"},{"issue":"3","key":"2239_CR29","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. M., & Trunfio, R. (2010). Simulation-based optimization for discharge\/loading operations at a maritime container terminal. OR Spectrum, 32(3), 543\u2013567.","journal-title":"OR Spectrum"},{"issue":"2","key":"2239_CR30","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10288-013-0235-2","volume":"12","author":"P Legato","year":"2014","unstructured":"Legato, P., & Trunfio, R. (2014). A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules. 4OR, 12(2), 123\u2013156.","journal-title":"4OR"},{"issue":"9","key":"2239_CR31","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. Computers and Operations Research, 39(9), 2063\u20132078.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2239_CR32","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s11590-014-0756-4","volume":"9","author":"M Liu","year":"2015","unstructured":"Liu, M., Zheng, F., & Li, J. (2015). Scheduling small number of quay cranes with non-interference constraint. Optimization Letters, 9(2), 403\u2013412.","journal-title":"Optimization Letters"},{"issue":"6\u20137","key":"2239_CR33","doi-asserted-by":"crossref","first-page":"2113","DOI":"10.1166\/asl.2011.1533","volume":"4","author":"Z Lu","year":"2011","unstructured":"Lu, Z., Han, X., & Xi, L. (2011). Simultaneous berth and quay crane allocation problem in container terminal. Advanced Science Letters, 4(6\u20137), 2113\u20132118.","journal-title":"Advanced Science Letters"},{"issue":"12","key":"2239_CR34","doi-asserted-by":"crossref","first-page":"2915","DOI":"10.1016\/j.cor.2012.02.013","volume":"39","author":"Z Lu","year":"2012","unstructured":"Lu, Z., Han, X., Xi, L., & Erera, A. L. (2012). A heuristic for the quay crane scheduling problem based on contiguous bay crane operations. Computers and Operations Research, 39(12), 2915\u20132928.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"2239_CR35","first-page":"45","volume":"53","author":"F Meisel","year":"2011","unstructured":"Meisel, F. (2011). The quay crane scheduling problem with time windows. Naval Research Logistics (NRL), 53(1), 45\u201359.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"3","key":"2239_CR36","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. Computers and Operations Research, 38(3), 683\u2013693.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2239_CR37","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. (2013). A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transportation Science, 47(2), 131\u2013147.","journal-title":"Transportation Science"},{"issue":"3","key":"2239_CR38","doi-asserted-by":"crossref","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 Spectrum, 32(3), 569\u2013591.","journal-title":"OR Spectrum"},{"issue":"4","key":"2239_CR39","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1504\/IJSTL.2011.041137","volume":"3","author":"MF Monaco","year":"2011","unstructured":"Monaco, M. F., & Sammarra, M. (2011). Quay crane scheduling with time windows, one-way and spatial constraints. International Journal of Shipping and Transport Logistics, 3(4), 454\u2013474.","journal-title":"International Journal of Shipping and Transport Logistics"},{"issue":"4","key":"2239_CR40","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/s10696-012-9135-6","volume":"25","author":"H Nam","year":"2013","unstructured":"Nam, H., & Lee, T. (2013). A scheduling problem for a novel container transport system: A case of mobile harbor operation schedule. Flexible Services and Manufacturing Journal, 25(4), 576\u2013608.","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"8","key":"2239_CR41","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1016\/j.cor.2013.03.007","volume":"40","author":"S Nguyen","year":"2013","unstructured":"Nguyen, S., Zhang, M., Johnston, M., & Chen Tan, K. (2013). Hybrid evolutionary computation methods for quay crane scheduling problems. Computers and Operations Research, 40(8), 2083\u20132093.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"2239_CR42","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s13748-014-0056-3","volume":"2","author":"M Rodriguez-Molins","year":"2014","unstructured":"Rodriguez-Molins, M., Ingolotti, L., Barber, F., Salido, M. A., Sierra, M. R., & Puente, J. (2014). A genetic algorithm for robust berth allocation and quay crane assignment. Progress in Artificial Intelligence, 2(4), 177\u2013192.","journal-title":"Progress in Artificial Intelligence"},{"key":"2239_CR43","doi-asserted-by":"crossref","unstructured":"Schoonenberg, W., Hols, J., & Diabat, A. (2015). A cost based approach for a crane assignment and scheduling problem. In International Conference on Industrial Engineering and Systems Management (IESM), Seville, Spain, October 21\u201323.","DOI":"10.1109\/IESM.2015.7380227"},{"issue":"4","key":"2239_CR44","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/s10696-012-9134-7","volume":"25","author":"K Shin","year":"2013","unstructured":"Shin, K., & Lee, T. (2013). Container loading and unloading scheduling for a Mobile Harbor system: A global and local search method. Flexible Services and Manufacturing Journal, 25(4), 557\u2013575.","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"3","key":"2239_CR45","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1051\/ro\/2014039","volume":"49","author":"A Simrin","year":"2015","unstructured":"Simrin, A., & Diabat, A. (2015). The dynamic berth allocation problem: A linearized formulation. RAIRO Operations Research, 49(3), 473\u2013494.","journal-title":"RAIRO Operations Research"},{"issue":"1","key":"2239_CR46","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.cie.2011.08.024","volume":"62","author":"L Song","year":"2012","unstructured":"Song, L., Cherrett, T., & Guan, W. (2012). Study on berth planning problem in a container seaport: Using an integrated programming approach. Computers and Industrial Engineering, 62(1), 119\u2013128.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"2239_CR47","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0006-3207(01)00144-6","volume":"103","author":"MN Tamburri","year":"2002","unstructured":"Tamburri, M. N., Wasson, K., & Matsuda, M. (2002). Ballast water deoxygenation can prevent aquatic introductions while reducing ship corrosion. Biological Conservation, 103(3), 331\u2013341.","journal-title":"Biological Conservation"},{"issue":"3","key":"2239_CR48","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.ejor.2013.08.050","volume":"236","author":"L Tang","year":"2014","unstructured":"Tang, L., Zhao, J., & Liu, J. (2014). Modeling and solution of the joint quay crane and truck scheduling problem. European Journal of Operational Research, 236(3), 978\u2013990.","journal-title":"European Journal of Operational Research"},{"key":"2239_CR49","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1007\/s11590-014-0787-x","volume":"9","author":"E Theodorou","year":"2015","unstructured":"Theodorou, E., & Diabat, A. (2015). A joint quay crane assignment and scheduling problem: Formulation, solution algorithm and computational results. Optimization Letters, 9, 799\u2013817.","journal-title":"Optimization Letters"},{"key":"2239_CR50","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.tre.2013.08.006","volume":"59","author":"O Unsal","year":"2013","unstructured":"Unsal, O., & Oguz, C. (2013). Constraint programming approach to quay crane scheduling problem. Transportation Research Part E: Logistics and Transportation Review, 59, 108\u2013122.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"2239_CR51","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/trsc.1120.0428","volume":"47","author":"I Vacca","year":"2013","unstructured":"Vacca, I., Salani, M., & Bierlaire, M. (2013). An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47(2), 148\u2013161.","journal-title":"Transportation Science"},{"issue":"3","key":"2239_CR52","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s00291-010-0201-8","volume":"32","author":"IFA Vis","year":"2010","unstructured":"Vis, I. F. A., & van Anholt, R. G. (2010). Performance analysis of berth configurations at container terminals. OR Spectrum, 32(3), 453\u2013476.","journal-title":"OR Spectrum"},{"issue":"1","key":"2239_CR53","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3141\/2330-07","volume":"2330","author":"J Wang","year":"2013","unstructured":"Wang, J., Hu, H., & Song, Y. (2013). Optimization of quay crane scheduling constrained by stability of vessels. Transportation Research Record: Journal of the Transportation Research Board, 2330(1), 47\u201354.","journal-title":"Transportation Research Record: Journal of the Transportation Research Board"},{"issue":"3","key":"2239_CR54","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10845-009-0303-9","volume":"22","author":"Y Wang","year":"2011","unstructured":"Wang, Y., & Kim, K. H. (2011). A quay crane scheduling algorithm considering the workload of yard cranes in a container yard. Journal of Intelligent Manufacturing, 22(3), 459\u2013470.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"2239_CR55","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.phpro.2012.03.128","volume":"25","author":"S Wang","year":"2012","unstructured":"Wang, S., Zheng, J., Zheng, K., Guo, J., & Liu, X. (2012). Multi resource scheduling problem based on an improved discrete particle swarm optimization. Physics Procedia, 25, 576\u2013582.","journal-title":"Physics Procedia"},{"issue":"5","key":"2239_CR56","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. Operations Research Letters, 36(5), 579\u2013583.","journal-title":"Operations Research Letters"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2239-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2239-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2239-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2239-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:50:05Z","timestamp":1498319405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2239-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,6]]},"references-count":56,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["2239"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2239-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,6]]}}}