{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T05:50:18Z","timestamp":1691733018203},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0377-2217(99)00351-3","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"74-97","source":"Crossref","is-referenced-by-count":9,"title":["Stack-up algorithms for palletizing at delivery industry"],"prefix":"10.1016","volume":"128","author":[{"given":"J.","family":"Rethmann","sequence":"first","affiliation":[]},{"given":"E.","family":"Wanke","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00351-3_BIB1","unstructured":"N. Ascheuer, M. Gr\u00f6tschel, A. Abdel-Aziz Abdel-Hamid. Orderpicking in an Automatic Warehouse: Solving Online Asymetric TSPs. Technical Report 35\/98, Konrad-Zuse -Zentrum f\u00fcr Informationstechnik, D-14195 Berlin, Germany, 1998"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/363011.363155","article-title":"An anomaly in space-time characteristics of certain programs running in a paging machine","volume":"12","author":"Belady","year":"1969","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB3","unstructured":"Borodin, A. On-line Computation and Competitive Analysis. Cambridge University Press, Cambridge, 1998"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB4","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/0377-2217(94)90423-5","article-title":"Performance approximation of pick-to-belt orderpicking systems","volume":"92","author":"de Koster","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB5","doi-asserted-by":"crossref","unstructured":"A. Fiat, G.J. Woeginger (Eds.). Online Algorithms: The state of the art, volume 1442 of Lecture Notes in Computer Science. Springer, Berlin, 1998","DOI":"10.1007\/BFb0029562"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB6","unstructured":"M.R. Graey, D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, San Francisco, 1979"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB7","doi-asserted-by":"crossref","unstructured":"J.H. Lin, J.S. Vitter. \u03b5-Approximations with Minimum Packing Constraint Violation. In Proceedings of the Annual ACM Symposium on Theory of Computting, pp. 771\u2013781. ACM, 1992","DOI":"10.1145\/129712.129787"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB8","doi-asserted-by":"crossref","unstructured":"M.S. Manasse, L.A. McGeoch, D.D. Sleator. Competitive algorthims for on-line problems. In Proceedings of the Annual ACM Symposium on Theory of Computting, pages 322\u2013333. ACM, 1988","DOI":"10.1145\/62212.62243"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1287\/opre.31.3.507","article-title":"Orderpicking in a rectangular warehouse: A solvable case of the travelling salesman problem","volume":"31","author":"Ratacliff","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB10","doi-asserted-by":"crossref","unstructured":"R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, H.B. Hunt. Many birds with one stone: Multi-objective approximation algorithms. In Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 438\u2013447. ACM, 1993","DOI":"10.1145\/167088.167209"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB11","doi-asserted-by":"crossref","unstructured":"J. Rethmann, E. Wanke. An approximation algorithm for stacking up bins from a conveyer onto pallets. In Proceeedings of the Annual Workshop on Algorithms and Data Structures, volume 1272 of Lecture Notes in Computer Science, pp. 440\u2013449. 1997, Springer, Berlin","DOI":"10.1007\/3-540-63307-3_81"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB12","doi-asserted-by":"crossref","unstructured":"J. Rethmann, E. Wanke. Competitive analysis of on-line stack-up algorithms. In Proceeedings of the Annual European Symposium on Algorithms, volume 1284 of Lecture Notes in Computer Science, pp. 402\u2013415. 1997, Springer, Berlin","DOI":"10.1007\/3-540-63397-9_31"},{"issue":"3","key":"10.1016\/S0377-2217(99)00351-3_BIB13","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/S0377-2217(96)00303-7","article-title":"Storage controlled pile-up systems","volume":"103","author":"Rethmann","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB14","doi-asserted-by":"crossref","unstructured":"J. Rethmann, E. Wanke. An optimal algorithm for on-line palletizing at delivery industry, In Proceeedings of the International Symposium on Algorithms and Computation, volume 1533 of Lecture Notes in Computer Science, pages 109-118. 1998, Springer, Berlin","DOI":"10.1007\/3-540-49381-6_13"},{"key":"10.1016\/S0377-2217(99)00351-3_BIB15","unstructured":"A.S. Tanenbaum. Operating Systems. Prentice-Hall, Englewood Cliffs, NJ, 1987"},{"issue":"1","key":"10.1016\/S0377-2217(99)00351-3_BIB16","first-page":"70","volume":"35","author":"Warburton","year":"1987","journal-title":"Approximation of Pareto optima in multiple-objective shortest path problems. operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003513?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003513?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T16:17:43Z","timestamp":1579018663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799003513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0377221799003513"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00351-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}