{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:17:08Z","timestamp":1775128628855,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:00:00Z","timestamp":1673308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:00:00Z","timestamp":1673308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00291-022-00703-x","type":"journal-article","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T01:02:23Z","timestamp":1673312543000},"page":"395-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The blocks relocation problem with item families minimizing the number of reshuffles"],"prefix":"10.1007","volume":"45","author":[{"given":"Sven","family":"Boge","sequence":"first","affiliation":[]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,10]]},"reference":[{"issue":"1","key":"703_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/PL00020912","volume":"49","author":"U Blasum","year":"1999","unstructured":"Blasum U, Bussieck MR, Hochst\u00e4ttler W, Moll C, Scheel H-H, Winter T (1999) Scheduling trams in the morning. Math Methods Oper Res 49(1):137\u2013148","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"703_CR2","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.ejor.2019.08.005","volume":"280","author":"S Boge","year":"2020","unstructured":"Boge S, Knust S (2020) The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage. Eur J Oper Res 280(3):940\u2013952","journal-title":"Eur J Oper Res"},{"issue":"1","key":"703_CR3","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 (2012) A mathematical formulation and complexity considerations for the blocks relocation problem. Eur J Oper Res 219(1):96\u2013104","journal-title":"Eur J Oper Res"},{"issue":"4","key":"703_CR4","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00291-006-0038-3","volume":"28","author":"R Dekker","year":"2006","unstructured":"Dekker R, Voogd P, van Asperen E (2006) Advanced methods for container stacking. OR Spectrum 28(4):563\u2013586","journal-title":"OR Spectrum"},{"issue":"3","key":"703_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","volume":"46","author":"RW Eglese","year":"1990","unstructured":"Eglese RW (1990) Simulated annealing: a tool for operational research. Eur J Oper Res 46(3):271\u2013281","journal-title":"Eur J Oper Res"},{"issue":"9","key":"703_CR6","doi-asserted-by":"publisher","first-page":"8337","DOI":"10.1016\/j.eswa.2012.01.187","volume":"39","author":"C Exp\u00f3sito-Izquierdo","year":"2012","unstructured":"Exp\u00f3sito-Izquierdo C, Meli\u00e1n-Batista B, Moreno-Vega JM (2012) Pre-marshalling problem: heuristic solution method and instances generator. Expert Syst Appl 39(9):8337\u20138349","journal-title":"Expert Syst Appl"},{"key":"703_CR7","unstructured":"Fernandes E, Freire L, Passos A, Street A (2012) Solving the non-linear slab stack shuffling problem using linear binary integer programming. In: EngOpt 2012-3rd international conference on engineering optimization"},{"issue":"2","key":"703_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.cor.2011.04.004","volume":"39","author":"F Forster","year":"2012","unstructured":"Forster F, Bortfeldt A (2012) A tree search procedure for the container relocation problem. Comput Oper Res 39(2):299\u2013309","journal-title":"Comput Oper Res"},{"issue":"3","key":"703_CR9","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2014.07.038","volume":"240","author":"B Jin","year":"2015","unstructured":"Jin B, Zhu W, Lim A (2015) Solving the container relocation problem by an improved greedy look-ahead heuristic. Eur J Oper Res 240(3):837\u2013847","journal-title":"Eur J Oper Res"},{"issue":"3","key":"703_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0377-2217(78)90095-4","volume":"2","author":"L Kaufman","year":"1978","unstructured":"Kaufman L, Broeckx F (1978) An algorithm for the quadratic assignment problem using Bender\u2019s decomposition. Eur J Oper Res 2(3):207\u2013211","journal-title":"Eur J Oper Res"},{"issue":"2","key":"703_CR11","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 (2014) Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur J Oper Res 239(2):297\u2013312","journal-title":"Eur J Oper Res"},{"key":"703_CR12","first-page":"2955","volume":"37","author":"T Li","year":"2017","unstructured":"Li T, Luan Z, Wang B, Dong G (2017) Estimation of distribution algorithm for solving the slab stack shuffling and relocation problem. Xitong Gongcheng Lilun yu Shijian\/Syst Eng Theory Pract 37:2955\u20132964","journal-title":"Xitong Gongcheng Lilun yu Shijian\/Syst Eng Theory Pract"},{"key":"703_CR13","doi-asserted-by":"crossref","unstructured":"Ren H, Tang L (2010) Modeling and an ILP-based algorithm framework for the slab stack shuffling problem considering crane scheduling. In: 2010 international conference on computing, control and industrial engineering, vol 2, pp 3\u20136","DOI":"10.1109\/CCIE.2010.119"},{"issue":"2","key":"703_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ijpe.2003.07.005","volume":"91","author":"KA Singh","year":"2004","unstructured":"Singh KA, Tiwari MK (2004) Modelling the slab stack shuffling problem in developing steel rolling schedules and its solution using improved parallel genetic algorithms. Int J Prod Econ 91(2):135\u2013147","journal-title":"Int J Prod Econ"},{"issue":"2","key":"703_CR15","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.cor.2009.05.011","volume":"37","author":"L Tang","year":"2010","unstructured":"Tang L, Ren H (2010) Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem. Comput Oper Res 37(2):368\u2013375","journal-title":"Comput Oper Res"},{"issue":"10","key":"703_CR16","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1057\/palgrave.jors.2601143","volume":"52","author":"L Tang","year":"2001","unstructured":"Tang L, Liu J, Rong A, Yang Z (2001) An effective heuristic algorithm to minimise stack shuffles in selecting steel slabs from the slab yard for heating and rolling. J Oper Res Soc 52(10):1091\u20131097","journal-title":"J Oper Res Soc"},{"issue":"7","key":"703_CR17","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1080\/00207540110110118424","volume":"40","author":"L Tang","year":"2002","unstructured":"Tang L, Liu J, Rong A, Yang Z (2002) Modelling and a genetic algorithm solution for the slab stack shuffling problem when implementing steel rolling schedules. Int J Prod Res 40(7):1583\u20131595","journal-title":"Int J Prod Res"},{"issue":"1","key":"703_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1018907720194","volume":"96","author":"T Winter","year":"2000","unstructured":"Winter T, Zimmermann UT (2000) Real-time dispatch of trams in storage yards. Ann Oper Res 96(1):287\u2013315","journal-title":"Ann Oper Res"},{"issue":"4","key":"703_CR19","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 (2012) Iterative deepening A* algorithms for the container relocation problem. IEEE Trans Autom Sci Eng 9(4):710\u2013722","journal-title":"IEEE Trans Autom Sci Eng"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-022-00703-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-022-00703-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-022-00703-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T11:03:12Z","timestamp":1685012592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-022-00703-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["703"],"URL":"https:\/\/doi.org\/10.1007\/s00291-022-00703-x","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,10]]},"assertion":[{"value":"20 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}