{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:05:36Z","timestamp":1742965536787,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008970"},{"type":"electronic","value":"9783030008987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00898-7_10","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T12:27:11Z","timestamp":1537360031000},"page":"168-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Lower Bound for the Block Relocation Problem"],"prefix":"10.1007","author":[{"given":"Tiziano","family":"Bacci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Mattia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Ventura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"key":"10_CR1","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-319-67308-0_48","volume-title":"Optimization and Decision Science: Methodologies and Applications","author":"T Bacci","year":"2017","unstructured":"Bacci, T., Mattia, S., Ventura, P.: Some complexity results for the minimum blocking items problem. In: Sforza, A., Sterle, C. (eds.) ODS 2017. PROMS, vol. 217, pp. 475\u2013483. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-67308-0_48"},{"issue":"45","key":"10_CR2","doi-asserted-by":"publisher","first-page":"6261","DOI":"10.1016\/j.tcs.2011.07.012","volume":"412","author":"F Bonomo","year":"2011","unstructured":"Bonomo, F., Mattia, S., Oriolo, G.: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45), 6261\u20136268 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","volume":"235","author":"H Carlo","year":"2014","unstructured":"Carlo, H., Vis, I., Roodbergen, K.: Storage yard operations in container terminals: literature overview, trends, and research directions. Eur. J. Oper. Res. 235(2), 412\u2013430 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2011.12.039","volume":"219","author":"M Caserta","year":"2012","unstructured":"Caserta, M., Schwarze, S., Vo\u00df, S.: A mathematical formulation and complexity considerations for the blocks relocation problem. Eur. J. Oper. Res. 219, 96\u2013104 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00291-009-0176-5","volume":"33","author":"M Caserta","year":"2011","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectr. 33(4), 915\u2013929 (2011)","journal-title":"OR Spectr."},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b137951","volume-title":"Container Terminals and Automated Transport Systems","author":"HO G\u00fcnter","year":"2005","unstructured":"G\u00fcnter, H.O., Kim, K.H.: Container Terminals and Automated Transport Systems. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/b137951"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0890-5401(02)00028-7","volume":"180","author":"K Jansen","year":"2003","unstructured":"Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. Inf. Comput. 180, 71\u201381 (2003)","journal-title":"Inf. Comput."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2014.06.010","volume":"75","author":"R Jovanovic","year":"2014","unstructured":"Jovanovic, R., Vo\u00df, S.: A chain heuristic for the blocks relocation problem. Comput. Ind. Eng. 75, 79\u201386 (2014)","journal-title":"Comput. Ind. Eng."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"KH Kim","year":"2006","unstructured":"Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Comput. Oper. Res. 33, 940\u2013954 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"Suppl. C","key":"10_CR10","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.cor.2015.11.006","volume":"68","author":"D Ku","year":"2016","unstructured":"Ku, D., Arthanari, T.: On the abstraction method for the container relocation problem. Comput. Oper. Res. 68(Suppl. C), 110\u2013122 (2016)","journal-title":"Comput. Oper. Res."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1016\/j.cor.2009.10.005","volume":"47","author":"Y Lee","year":"2010","unstructured":"Lee, Y., Lee, Y.L.: A heuristic for retrieving containers from a yard. Comput. Oper. Res. 47, 1139\u20131147 (2010)","journal-title":"Comput. Oper. Res."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ejor.2014.03.011","volume":"239","author":"J Lehnfeld","year":"2014","unstructured":"Lehnfeld, J., Knust, S.: Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur. J. Oper. Res. 239, 297\u2013312 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TASE.2015.2434417","volume":"13","author":"S Tanaka","year":"2016","unstructured":"Tanaka, S., Takii, K.: A faster branch-and-bound algorithm for the block relocation problem. IEEE Trans. Autom. Sci. Eng. 13(1), 181\u2013190 (2016)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1002\/atr.1193","volume":"46","author":"T Unluyurt","year":"2012","unstructured":"Unluyurt, T., Aydin, C.: Improved rehandling strategies for the container retrieval process. J. Adv. Transp. 46(4), 378\u2013393 (2012)","journal-title":"J. Adv. Transp."},{"issue":"8","key":"10_CR15","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1002\/nav.20373","volume":"56","author":"Y Wan","year":"2009","unstructured":"Wan, Y., Liu, J., Tsai, P.C.: The assignment of storage locations to containers for a container stack. Nav. Res. Logist. 56(8), 699\u2013713 (2009)","journal-title":"Nav. Res. Logist."},{"key":"10_CR16","unstructured":"Wu, K.C., Ting, C.J.: A beam search algorithm for minimizing reshuffle operations at container yards. In: International Conference on Logistics and Maritime Systems, Busan, Korea, 15\u201317 September 2010 (2010)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TASE.2012.2198642","volume":"9","author":"W Zhu","year":"2012","unstructured":"Zhu, W., Qin, H., Lim, A., Zhang, H.: Iterative deepening A* algorithms for the container relocation problem. IEEE Trans. Autom. Sci. Eng. 9, 710\u2013722 (2012)","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00898-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:43:54Z","timestamp":1558327434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00898-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008970","9783030008987"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00898-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}