{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:31Z","timestamp":1759638271040},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,23]],"date-time":"2015-10-23T00:00:00Z","timestamp":1445558400000},"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":["Math Meth Oper Res"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00186-015-0518-9","type":"journal-article","created":{"date-parts":[[2015,10,23]],"date-time":"2015-10-23T14:39:58Z","timestamp":1445611198000},"page":"33-52","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the complexity of the FIFO stack-up problem"],"prefix":"10.1007","volume":"83","author":[{"given":"Frank","family":"Gurski","sequence":"first","affiliation":[]},{"given":"Jochen","family":"Rethmann","sequence":"additional","affiliation":[]},{"given":"Egon","family":"Wanke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,23]]},"reference":[{"key":"518_CR1","first-page":"1","volume":"11","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender HL (1993) A tourist guide through treewidth. Acta Cybern 11:1\u201323","journal-title":"Acta Cybern"},{"key":"518_CR2","volume-title":"On-line computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A (1998) On-line computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"518_CR3","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/0377-2217(94)90423-5","volume":"92","author":"R Koster de","year":"1994","unstructured":"de Koster R (1994) Performance approximation of pick-to-belt orderpicking systems. Eur J Oper Res 92:558\u2013573","journal-title":"Eur J Oper Res"},{"key":"518_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","volume-title":"Online algorithms: The state of the art, volume 1442 of LNCS","author":"A Fiat","year":"1998","unstructured":"Fiat A, Woeginger GJ (1998) Online algorithms: The state of the art, volume 1442 of LNCS. Springer, New York"},{"key":"518_CR5","unstructured":"Gurski F, Rethmann J, Wanke E (2013) Complexity of the FIFO stack-up problem. ACM computing research repository (CoRR), arXiv:1307.1915"},{"key":"518_CR6","doi-asserted-by":"crossref","unstructured":"Gurski F, Rethmann J, Wanke E (2014) Moving bins from conveyor belts onto pallets using FIFO queues. In: Proceedings of the international conference on operations research (OR 2013), Selected papers, Springer, pp 185\u2013191","DOI":"10.1007\/978-3-319-07001-8_25"},{"key":"518_CR7","doi-asserted-by":"crossref","unstructured":"Gurski F, Rethmann J, Wanke E (2015) A practical approach for the FIFO stack-up problem. In: Modelling, computation and optimization in information systems and management sciences, Advances in intelligent systems and computing, vol 360. Springer, pp 141\u2013152","DOI":"10.1007\/978-3-319-18167-7_13"},{"key":"518_CR8","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T Johnson","year":"2001","unstructured":"Johnson T, Robertson N, Seymour PD, Thomas R (2001) Directed tree-width. J Comb Theory Ser B 82:138\u2013155","journal-title":"J Comb Theory Ser B"},{"key":"518_CR9","unstructured":"Kashiwabara T, Fujisawa T (1979) NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph. In: Proceedings of the international symposium on circuits and systems, pp 657\u2013660"},{"key":"518_CR10","unstructured":"Kitsunai K, Kobayashi Y, Komuro K, Tamaki H, Tano T (2012) Computing directed pathwidth in $${O}(1.89^n)$$ O ( 1 . 89 n ) time. In: Proceedings of international workshop on parameterized and exact computation, LNCS, vol 7535. Springer, pp 182\u2013193"},{"key":"518_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","volume":"58","author":"B Monien","year":"1988","unstructured":"Monien B, Sudborough IH (1988) Min cut is NP-complete for edge weighted trees. Theor Comput Sci 58:209\u2013229","journal-title":"Theor Comput Sci"},{"key":"518_CR12","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley Publishing Company, New York"},{"issue":"3","key":"518_CR13","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, theoretical foundations. Eur J Oper Res 103(3):515\u2013530","journal-title":"Eur J Oper Res"},{"key":"518_CR14","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s001860050085","volume":"51","author":"J Rethmann","year":"2000","unstructured":"Rethmann J, Wanke E (2000) On approximation algorithms for the stack-up problem. Math Methods Oper Res 51:203\u2013233","journal-title":"Math Methods Oper Res"},{"issue":"1","key":"518_CR15","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"},{"key":"518_CR16","doi-asserted-by":"crossref","unstructured":"Tamaki H (2011) A polynomial time algorithm for bounded directed pathwidth. In: Proceedings of graph-theoretical concepts in computer science, LNCS, vol 6986. Springer, pp 331\u2013342","DOI":"10.1007\/978-3-642-25870-1_30"},{"key":"518_CR17","doi-asserted-by":"crossref","unstructured":"Yam KL (ed) (2009) The Wiley encyclopedia of packaging technology. Wiley, New York","DOI":"10.1002\/9780470541395"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-015-0518-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-015-0518-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-015-0518-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:33Z","timestamp":1558622013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-015-0518-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,23]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["518"],"URL":"https:\/\/doi.org\/10.1007\/s00186-015-0518-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,23]]}}}