Skip to main content
SpringerLink
Log in

The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper considers an on-line scheduling and routing problem concerning the automated storage and retrieval system from tobacco industry. In this problem, stacker cranes run on one common rail between two racks. Multiple input/output-points are located at the bottom of the racks. The stacker cranes transport bins between the input/output-points and cells on the racks to complete requests generated over time. Each request should be accomplished within its response time. The objective is to minimize the time by which all the generated requests are completed. Under a given physical layout, the authors study the complexity of the problem and design on-line algorithms for both one-stacker-crane model and two-stacker-crane model. The algorithms are validated by instances and numerical simulations.

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

Similar content being viewed by others

References

  1. de Koster R, Le-Duc T, and Roodbergen K J, Design and control of warehouse order picking: A literature review, Eur. J. Oper. Res., 2007, 182(2): 481–501.

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Gu J, Goetschalckx M, and McGinnis L F, Research on warehouse design and performance evaluation: A comprehensive review, Eur. J. Oper. Res., 2010, 203(3): 539–549.

    Article  MATH  Google Scholar 

  4. Van den Berg J P and Gademann A J R M, Optimal routing in an automated storage/retrieval system with dedicated storage, IIE Trans., 1999, 31(5): 407–415.

    Article  Google Scholar 

  5. Vis I F A and Roodbergen K J, Scheduling of container storage and retrieval, Oper. Res., 2009, 57(2): 456–467.

    Article  MATH  Google Scholar 

  6. Vis I F A and Carlo H J, Sequencing two cooperating automated stacking cranes in a container terminal, Transport. Sci., 2010, 44(2): 169–182.

    Article  Google Scholar 

  7. Ng W C, Crane scheduling in container yards with inter-crane interference, Eur. J. Oper. Res., 2005, 164(1): 64–78.

    Article  MathSciNet  MATH  Google Scholar 

  8. Ho Y C and Su T S, The machine layout within a TFT-LCD bay with a multiple-stacker crane in-line stocker, Int. J. Prod. Res., 2012, 50(18): 5152–5172.

    Article  Google Scholar 

  9. Kung Y, Kobayashi Y, Higashi T, Sugi M, and Ota J, Order scheduling of multiple stacker cranes on common rails in an automated storage/retrieval system, Int. J. Prod. Res., 2014, 52(4): 1171–1187.

    Article  Google Scholar 

  10. Kuhn H W, The Hungarian method for the assignment problem, Nav. Res. Logist. Q., 1955, 2(1–2): 83–97.

    Article  MathSciNet  MATH  Google Scholar 

  11. Munkres J, Algorithms for the assignment and transportation problems, J. Soc. Ind. Appl. Math., 1957, 5(1): 32–38.

    Article  MathSciNet  MATH  Google Scholar 

  12. de Paepe W E, Lenstra J K, Sgall J, Sitters R A, and Stougie L, Computer-aided complexity classification of dial-a-ride problems, INFORMS J. Comput., 2004, 16(2): 120–132.

    Article  MathSciNet  MATH  Google Scholar 

  13. Atallah M J and Kosaraju S R, Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAM J. Comput., 1988, 17(5): 849–869.

    Article  MathSciNet  MATH  Google Scholar 

  14. Frederickson G N and Guan D J, Nonpreemptive ensemble motion planning on a tree, J. Algorithms, 1993, 15(1): 29–60.

    Article  MathSciNet  MATH  Google Scholar 

  15. Hauptmeier D, Krumke S O, Rambau J, and Wirth H C, Euler is standing in line dial-a-ride problems with precedence-constraints, Discrete Appl. Math., 2001, 113(1): 87–107.

    Article  MathSciNet  MATH  Google Scholar 

  16. Coja-Oghlan A, Krumke S O, and Nierhoff T, A hard dial-a-ride problem that is easy on average, J. Scheduling, 2005, 8(3): 197–210.

    Article  MathSciNet  MATH  Google Scholar 

  17. Ascheuer N, Krumke S O, and Rambau J, Online dial-a-ride problems: Minimizing the completion time, STACS, 2000: 639–650.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China

    Qiang Gao & Xiwen Lu

Authors
  1. Qiang Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiwen Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiwen Lu.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant No. 11371137 and Research Fund for the Doctoral Program of China under Grant No. 20120074110021.

This paper was recommended for publication by Editor ZHANG Xun.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gao, Q., Lu, X. The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail. J Syst Sci Complex 29, 1302–1319 (2016). https://doi.org/10.1007/s11424-015-4197-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-015-4197-7

Keywords

Search

Navigation