{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:46:14Z","timestamp":1777567574407,"version":"3.51.4"},"reference-count":57,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2019,2,1]]},"DOI":"10.1080\/00207543.2018.1489154","type":"journal-article","created":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T18:41:36Z","timestamp":1530470496000},"page":"888-906","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":36,"title":["Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic"],"prefix":"10.1080","volume":"57","author":[{"given":"Melih","family":"\u00c7elik","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, Middle East Technical University, Ankara, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haldun","family":"S\u00fcral","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Middle East Technical University, Ankara, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2018,7,1]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1421780"},{"key":"CIT0002","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate D. L.","year":"2011"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400322287"},{"key":"CIT0004","unstructured":"Bartholdi, J. J., and S. Hackman. 2016. \u201cWarehouse and Distribution Science.\u201d Release 0.97. Accessed July 2017. http:\/\/www.isye.gatech.edu\/jjb\/wh\/book\/editions\/wh-sci-0.97.pdf."},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.538"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144596297514"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1154624"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1251625"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.796421"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2014.09.029"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.06.013"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-014-0871-1"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/s10696\u2013017\u20139277\u20137"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2015.03.021"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582008"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.07.009"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1080\/07408179808966487"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.11.017"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2017.04.003"},{"key":"CIT0020","doi-asserted-by":"crossref","unstructured":"Garey, M. R., R. L. Graham, and D. S. Johnson. 1976. \u201cSome NP-Complete Geometric Problems.\u201d InProceedings of the 8th Annual ACM Symposium on Theory of Computing, 10\u201322. New\u00a0York: Association for Computing Machinery.","DOI":"10.1145\/800113.803626"},{"key":"CIT0021","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2017.04.002"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.919424"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1080\/07408170802112726"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1080\/07408179308964306"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.07.003"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1137\/0211056"},{"key":"CIT0029","unstructured":"Johnson, D. S., and C. H. Papadimitriou. 1985. \u201cComputational Complexity.\u201d InThe Traveling Salesman Problem, edited by E.\u00a0L.\u00a0Lawler, J.\u00a0K.\u00a0Lenstra, J.\u00a0K.\u00a0Rinnooy Kan, and D.\u00a0B.\u00a0Shmoys, 37\u201385. Hoboken, NJ: John Wiley."},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"Karp, R. M. 1972. \u201cReducibility among Combinatorial Problems.\u201d InComplexity of Computer Computations, edited by R.\u00a0E.\u00a0Miller, J.\u00a0W.\u00a0Thatcher, and J.\u00a0D.\u00a0Bohlinger, 85\u2013103. Boston, MA: Springer US.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1436784"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1187313"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.03.009"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1016\/S0307-904X(02)00137-3"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.05.011"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.001"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.11.025"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1080\/0740817X.2011.636793"},{"key":"CIT0040","unstructured":"Pansart, L., N. Catusse, and H. Cambazard. 2017. \u201cExact Algorithms for the Picking Problem.\u201dArXiv:1703.00699."},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.3.507"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1080\/00207540110028128"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00177-6"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.978029"},{"key":"CIT0046","unstructured":"Ruberg, Y., and A. Scholz. 2016. \u201cA Mathematical Programming Formulation for the Single-Picker Routing Problem in a Multi-Block Layout.\u201d Working Paper 2\/2016. Faculty of Economics and Management, Universit\u00e4t Magdeburg, Germany."},{"key":"CIT0047","unstructured":"Scholz, A. 2016. \u201cAn Exact Solution Approach for the Single-Picker Routing Problem in Warehouses with an Arbitrary Block Layout.\u201d Working Paper 6\/2016. Faculty of Economics and Management, Universit\u00e4t Magdeburg, Germany."},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.02.018"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-017-0467-x"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2014.08.002"},{"key":"CIT0051","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.01.036"},{"key":"CIT0052","volume-title":"Facilities Planning","author":"Tompkins J. A.","year":"2010"},{"key":"CIT0053","doi-asserted-by":"crossref","unstructured":"Umans, C., and W. Lenhart. 1997. \u201cHamiltonian Cycles in Solid Grid Graphs.\u201d InProceedings of the 38th Annual Symposium on Foundations of Computer Science, 496\u2013505. Miami Beach, FL: IEEE.","DOI":"10.1109\/SFCS.1997.646138"},{"key":"CIT0054","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.03.069"},{"key":"CIT0055","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.09.002"},{"key":"CIT0056","doi-asserted-by":"publisher","DOI":"10.1080\/002075499191580"},{"key":"CIT0057","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1264641"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2018.1489154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T13:38:57Z","timestamp":1751722737000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2018.1489154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,1]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,2,1]]}},"alternative-id":["10.1080\/00207543.2018.1489154"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2018.1489154","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,1]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2017-07-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}