{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T01:17:53Z","timestamp":1724462273108},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T00:00:00Z","timestamp":1551052800000},"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":["OR Spectrum"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00291-019-00549-w","type":"journal-article","created":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T20:16:19Z","timestamp":1551039379000},"page":"581-611","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms"],"prefix":"10.1007","volume":"41","author":[{"given":"Frank","family":"Gurski","sequence":"first","affiliation":[]},{"given":"Carolin","family":"Rehs","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"Rethmann","sequence":"additional","affiliation":[]},{"given":"Egon","family":"Wanke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,25]]},"reference":[{"issue":"1","key":"549_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S Albers","year":"2003","unstructured":"Albers S (2003) Online algorithms: a survey. Math Program 97(1):3\u201326","journal-title":"Math Program"},{"issue":"2","key":"549_CR2","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.ejor.2015.09.033","volume":"249","author":"N Boysen","year":"2016","unstructured":"Boysen N, Emde S (2016) The parallel stack loading problem to minimize blockages. Eur J Oper Res 249(2):618\u2013627","journal-title":"Eur J Oper Res"},{"issue":"1","key":"549_CR3","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.ejor.2018.03.026","volume":"270","author":"N Boysen","year":"2018","unstructured":"Boysen N, Fedtke S, Weidinger F (2018) Optimizing automated sorting in warehouses: the minimum order spread sequencing problem. Eur J Oper Res 270(1):386\u2013400","journal-title":"Eur J Oper Res"},{"key":"549_CR4","doi-asserted-by":"crossref","unstructured":"Brueggeman L, Fellows MR, Fleischer R, Lackner M, Komusiewicz C, Koutis Y, Pfandler A, Rosamond FA (2012) Train marshalling is fixed parameter tractable. In: Fun with algorithms. Springer, Berlin, pp 51\u201356","DOI":"10.1007\/978-3-642-30347-0_8"},{"issue":"1","key":"549_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(99)00219-X","volume":"103","author":"E Dahlhaus","year":"2000","unstructured":"Dahlhaus E, Horak P, Miller M, Ryan JF (2000) The train marshalling problem. Discrete Appl Math 103(1):41\u201354","journal-title":"Discrete Appl Math"},{"issue":"2","key":"549_CR6","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"R Koster De","year":"2007","unstructured":"De Koster R, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: a literature review. Eur J Oper Res 182(2):481\u2013501","journal-title":"Eur J Oper Res"},{"key":"549_CR7","doi-asserted-by":"crossref","unstructured":"Felsner S, Pergel M (2008) The complexity of sorting with networks of stacks and queues. In: European symposium on algorithms. Springer, Berlin, pp 417\u2013429","DOI":"10.1007\/978-3-540-87744-8_35"},{"key":"549_CR8","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. W.H. Freeman and Company, San Francisco"},{"key":"549_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24367-7","volume-title":"Comprehensive logistics","author":"T Gudehus","year":"2012","unstructured":"Gudehus T, Kotzab H (2012) Comprehensive logistics. Springer, Berlin"},{"issue":"4","key":"549_CR10","doi-asserted-by":"crossref","first-page":"274","DOI":"10.19139\/83","volume":"2","author":"F Gurski","year":"2014","unstructured":"Gurski F (2014) Efficient binary linear programming formulations for Boolean functions. Stat Optim Inf Comput 2(4):274\u2013279","journal-title":"Stat Optim Inf Comput"},{"key":"549_CR11","doi-asserted-by":"crossref","unstructured":"Gurski F, Rethmann J, Wanke E (2015) A practical approach for the FIFO stack-up problem. In: Modeling, computation and optimization in information systems and management sciences (MCO), vol 360 of Advances in intelligent systems and computing. Springer, Berlin, pp 141\u2013152","DOI":"10.1007\/978-3-319-18167-7_13"},{"issue":"1","key":"549_CR12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00186-015-0518-9","volume":"83","author":"F Gurski","year":"2016","unstructured":"Gurski F, Rethmann J, Wanke E (2016) On the complexity of the FIFO stack-up problem. Math Methods Oper Res 83(1):33\u201352","journal-title":"Math Methods Oper Res"},{"key":"549_CR13","doi-asserted-by":"crossref","unstructured":"Gurski F, Rethmann J, Wanke E (2017) An experimental study of algorithms for controlling palletizers. In: Operations research proceedings (OR 2015). Springer, Berlin, pp 27\u201334","DOI":"10.1007\/978-3-319-42902-1_4"},{"key":"549_CR14","doi-asserted-by":"crossref","unstructured":"K\u00f6nig FG, L\u00fcbbecke ME (2008) Sorting with complete networks of stacks. In: International symposium on algorithms and computation (ISAAC). Springer, Berlin, pp 895\u2013906","DOI":"10.1007\/978-3-540-92182-0_78"},{"issue":"3","key":"549_CR15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/S0377-2217(96)00303-7","volume":"103","author":"J Rethmann","year":"1997","unstructured":"Rethmann J, Wanke E (1997) Storage controlled pile-up systems. Eur J Oper Res 103(3):515\u2013530","journal-title":"Eur J Oper Res"},{"issue":"2","key":"549_CR16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s001860050085","volume":"51","author":"J Rethmann","year":"2000","unstructured":"Rethmann J, Wanke E (2000) An approximation algorithm for the stack-up problem. Math Methods Oper Res 51(2):203\u2013233","journal-title":"Math Methods Oper Res"},{"issue":"1","key":"549_CR17","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0377-2217(99)00351-3","volume":"128","author":"J Rethmann","year":"2001","unstructured":"Rethmann J, Wanke E (2001) Stack-up algorithms for palletizing at delivery industry. Eur J Oper Res 128(1):74\u201397","journal-title":"Eur J Oper Res"},{"issue":"2","key":"549_CR18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Sorting using networks of queues and stacks. J ACM 19(2):341\u2013346","journal-title":"J ACM"},{"issue":"10","key":"549_CR19","doi-asserted-by":"crossref","first-page":"1822","DOI":"10.1016\/j.dam.2007.08.045","volume":"156","author":"B Yang","year":"2008","unstructured":"Yang B, Cao Y (2008) Digraph searching, directed vertex separation and directed pathwidth. Discrete Appl Math 156(10):1822\u20131837","journal-title":"Discrete Appl Math"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-019-00549-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-019-00549-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-019-00549-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T19:08:41Z","timestamp":1582571321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-019-00549-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,25]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["549"],"URL":"https:\/\/doi.org\/10.1007\/s00291-019-00549-w","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,25]]},"assertion":[{"value":"15 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}