Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets
By:
References
- 1. Avriel, M., Penn, M., & Shpirer, N. (2000). Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Applied Mathematics, 103(1), 271–279.
- 2. C.Q. Zhang, J.Y. Liu, Y.-w. Wan, K.G. Murty, and R.J. Linn, Storage space allocation in container terminals, Transport Res Part B: Methodological 37 (2003), 883-903
- 3. F.G. König, M. Lübbecke, R. Möhring, G. Schäfer and I. Spenke, “Solutions to real-world instances of PSPACE-complete stacking” in: Proceedings 15th European Symposium on Algorithms, Eilat, Israel, 2007, pp. 729-740
- 4. Kim, K. H., & Hong, G.-P. (2006). A heuristic rule for relocationg blocks. Computers & Operations Research, 33(4), 940–954.
- 5. R. De Koster, T. Le-Duc and K.J. Roodbergen, Design and control of warehouse order picking: A literature review, Eur J Oper Res 182 (2007), 481-501
- 6. Tang, L., Zhao, R., & Liu, J. (2012). Models and algorithms for shuffling problems in steel plants. Naval Research Logistics, 59(7), 502–524
- 7. Wan, Y., Liu, J., & Tsai, P.-C. (2009). The assignment of storage locations to containers for a container stack. Naval Research Logistics, 56(8), 699–713
DOI: https://doi.org/10.2478/jlst-2018-0008 | Journal eISSN: 2784-7497
Language: English
Page range: 37 - 45
Published on: Oct 29, 2018
Published by: Sciendo
In partnership with: Paradigm Publishing Services
Publication frequency: 1 times per year
Related subjects:
© 2018 Jakob Marolt, Tone Lerher, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.