Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets

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.10.1016/S0166-218X(99)00245-0Search in Google Scholar

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-90310.1016/S0191-2615(02)00089-9Search in Google Scholar

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-74010.1007/978-3-540-75520-3_64Search in Google Scholar

4. Kim, K. H., & Hong, G.-P. (2006). A heuristic rule for relocationg blocks. Computers & Operations Research, 33(4), 940–954.10.1016/j.cor.2004.08.005Search in Google Scholar

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-50110.1016/j.ejor.2006.07.009Search in Google Scholar

6. Tang, L., Zhao, R., & Liu, J. (2012). Models and algorithms for shuffling problems in steel plants. Naval Research Logistics, 59(7), 502–52410.1002/nav.21503Search in Google Scholar

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–71310.1002/nav.20373Search in Google Scholar