Skip to main content
SpringerLink
Log in

Hybrid variable neighborhood search for automated warehouse scheduling

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We study a new scheduling problem which arise in real-life applications, such as managing complicated warehouses, storage areas, e-commerce malls. Inspired by the automated warehouse of a huge electronic manufacturer, we consider a new picking and packing process on several production lines equipped with parallel machines and intermediate buffer. The picking process is serviced by a limited fleet of transportation robots. Each robot delivers products from the storage to picking stations and back. Moreover, special constraints arise from the availability of parking slots and the duration of the customers’ order handling. For this new makespan minimization problem, we design a hybrid Variable Neighborhood Search(VNS) and Tabu Search(TS) framework. The search for a solution is conducted over a space of order permutations. Original randomized decoding procedure is constructed to evaluate the quality of solutions. Infeasible solutions can arise during the search process, thus we design a special mechanism to return into the feasible domain. We have conducted computational experiments on a set of instances based on real data, provided by the Huawei company with up to 1000 orders, 4 production lines, and 50 robots which corresponds to a typical one-day production plan. The proposed approach provides solutions with average relative error less than 2% from the lower bound.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. 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)

  2. Emmons, H., Vairaktarakis, G.: Flow Shop Scheduling. Algorithms, and Applications. Springer, US, Theoretical Results (2013)

  3. 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–1415 (1996)

    Article  MATH  Google Scholar 

  4. Leisten, R.: Flowshop sequencing problems with limited buffer storage. Int. J. Prod. Res. 28, 2085–2100 (1990)

    Article  MATH  Google Scholar 

  5. Ruiz, R., Vazquez-Rodriguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1–18 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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–401 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bellanger, A., Oulamara, A.: Scheduling hybrid flowshop with parallel batching machines and compatibilities. Comput. Oper. Res. 36(6), 1982–1992 (2009)

    Article  MATH  Google Scholar 

  8. 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–501 (2007)

    Article  MATH  Google Scholar 

  9. Roodbergen, K.J., Vis, I.F.A.: A survey of literature on automated storage and retrieval systems. Eur. J. Oper. Res. 194(2), 343–362 (2009)

    Article  MATH  Google Scholar 

  10. Ouzidan, A., Sevaux, M., Olteanu, A.L., et al.: On solving the order processing in picking workstations. Optim. Lett. 16, 5–35 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ouzidan A., Pardo E.G., Sevaux M., Olteanu AL., Duarte A.: BVNS approach for the order processing in parallel picking workstations. In: Mladenović N., Sleptchenko A., Sifaleras A., Omar M. (eds) Variable Neighborhood Search. ICVNS 2021. Lecture Notes in Computer Science, vol. 12559, Springer, Cham (2021)

  12. Menéndez, 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–512 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  13. Blaźewicz, 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

  14. Boysen, N., Koster, R., Weidinger, F.: Warehousing in the e-commerce era: a survey. J. Oper. Res. 277(2), 396–411 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423–454 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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–67 (2013)

    Article  MATH  Google Scholar 

  17. 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–249 (2019)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, 4, Koptyuga av., Novosibirsk, Russia

    Ivan Davydov, Yury Kochetov & Daniil Tolstykh

  2. Huawei Noah’s Ark Lab, Shenzhen, China

    Tong Xialiang & Liu Jiawen

Authors
  1. Ivan Davydov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yury Kochetov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniil Tolstykh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tong Xialiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Liu Jiawen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yury Kochetov.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Davydov, I., Kochetov, Y., Tolstykh, D. et al. Hybrid variable neighborhood search for automated warehouse scheduling. Optim Lett 17, 2185–2199 (2023). https://doi.org/10.1007/s11590-022-01921-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-022-01921-6

Keywords

Search

Navigation