{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:06:47Z","timestamp":1776114407571,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11590-022-01921-6","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T13:06:12Z","timestamp":1661173572000},"page":"2185-2199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid variable neighborhood search for automated warehouse scheduling"],"prefix":"10.1007","volume":"17","author":[{"given":"Ivan","family":"Davydov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7123-8647","authenticated-orcid":false,"given":"Yury","family":"Kochetov","sequence":"additional","affiliation":[]},{"given":"Daniil","family":"Tolstykh","sequence":"additional","affiliation":[]},{"given":"Tong","family":"Xialiang","sequence":"additional","affiliation":[]},{"given":"Liu","family":"Jiawen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"key":"1921_CR1","unstructured":"Bartholdi, J.J., III, Hackman, S.T.: Warehouse & distribution science release 0.98.1 The Supply Chain & Logistics Institute, Georgia Institute of Technology, USA (2019)"},{"key":"1921_CR2","doi-asserted-by":"crossref","unstructured":"Emmons, H., Vairaktarakis, G.: Flow Shop Scheduling. Algorithms, and Applications. Springer, US, Theoretical Results (2013)","DOI":"10.1007\/978-1-4614-5152-5"},{"key":"1921_CR3","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1080\/00207549608904972","volume":"34","author":"AG Guinet","year":"1996","unstructured":"Guinet, A.G., Solomon, M.M., Kedia, P., Dussachoy, A.: Computational study of heuristics for two-stage flexible flow shops. Int. J. Prod. Res. 34, 1399\u20131415 (1996)","journal-title":"Int. J. Prod. Res."},{"key":"1921_CR4","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"28","author":"R Leisten","year":"1990","unstructured":"Leisten, R.: Flowshop sequencing problems with limited buffer storage. Int. J. Prod. Res. 28, 2085\u20132100 (1990)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"1921_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz, R., Vazquez-Rodriguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1921_CR6","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/S0377-2217(02)00873-1","volume":"155","author":"B Wardono","year":"2004","unstructured":"Wardono, B., Fathi, Y.: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. Eur. J. Oper. Res. 155(2), 380\u2013401 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"1921_CR7","doi-asserted-by":"publisher","first-page":"1982","DOI":"10.1016\/j.cor.2008.06.011","volume":"36","author":"A Bellanger","year":"2009","unstructured":"Bellanger, A., Oulamara, A.: Scheduling hybrid flowshop with parallel batching machines and compatibilities. Comput. Oper. Res. 36(6), 1982\u20131992 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1921_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"R De Koster","year":"2007","unstructured":"De Koster, R., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: a literature review. Eur. J. Oper. Res. 182(2), 481\u2013501 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1921_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ejor.2008.01.038","volume":"194","author":"KJ Roodbergen","year":"2009","unstructured":"Roodbergen, K.J., Vis, I.F.A.: A survey of literature on automated storage and retrieval systems. Eur. J. Oper. Res. 194(2), 343\u2013362 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1921_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11590-020-01640-w","volume":"16","author":"A Ouzidan","year":"2020","unstructured":"Ouzidan, A., Sevaux, M., Olteanu, A.L., et al.: On solving the order processing in picking workstations. Optim. Lett. 16, 5\u201335 (2020)","journal-title":"Optim. Lett."},{"key":"1921_CR11","doi-asserted-by":"crossref","unstructured":"Ouzidan A., Pardo E.G., Sevaux M., Olteanu AL., Duarte A.: BVNS approach for the order processing in parallel picking workstations. In: Mladenovi\u0107 N., Sleptchenko A., Sifaleras A., Omar M. (eds) Variable Neighborhood Search. ICVNS 2021. Lecture Notes in Computer Science, vol. 12559, Springer, Cham (2021)","DOI":"10.1007\/978-3-030-69625-2_14"},{"key":"1921_CR12","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.cor.2016.01.020","volume":"78","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez, B., Pardo, E.G., Alonso-Ayuso, A., Molina, E., Duarte, A.: Variable neighborhood search strategies for the order batching problem. Comput. Oper. Res. 78, 500\u2013512 (2017)","journal-title":"Comput. Oper. Res."},{"key":"1921_CR13","unstructured":"Bla\u017aewicz, J., Brauner, N., Finke, G.: Scheduling with discrete resource constraints. In: J. Y-T. Leung, Handbook of scheduling. Algorithms, Models and performance analysis. pp.23-1 -23-18"},{"issue":"2","key":"1921_CR14","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2018.08.023","volume":"277","author":"N Boysen","year":"2019","unstructured":"Boysen, N., Koster, R., Weidinger, F.: Warehousing in the e-commerce era: a survey. J. Oper. Res. 277(2), 396\u2013411 (2019)","journal-title":"J. Oper. Res."},{"issue":"3","key":"1921_CR15","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2016","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2016)","journal-title":"EURO J. Comput. Optim."},{"issue":"1","key":"1921_CR16","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1134\/S1990478913010067","volume":"7","author":"PA Kononova","year":"2013","unstructured":"Kononova, P.A., Kochetov, Y.A.: The variable neighborhood search for the two machine flow shop problem with a passive prefetch. J. Appl. Industr. Math. 7(1), 54\u201367 (2013)","journal-title":"J. Appl. Industr. Math."},{"issue":"2","key":"1921_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1134\/S1990478919020054","volume":"13","author":"PA Kononova","year":"2019","unstructured":"Kononova, P.A., Kochetov, Y.A.: A local search algorithm for the single machine scheduling problem with setups and a storage. J. Appl. Industr. Math. 13(2), 239\u2013249 (2019)","journal-title":"J. Appl. Industr. Math."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01921-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01921-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01921-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T11:05:05Z","timestamp":1698663905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01921-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":17,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1921"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01921-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"6 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}