On the packing process in a shoe manufacturer

References

• Agrawal, P. K. (1993). Determining stock-sheet-sizes to minimise trim loss. European Journal of Operational Research, 64 (3), 423–431. doi:10.1016/0377-2217(93)90131-6
   Web of Science ®Google Scholar
• Allen, S. D., Burke, E. K., & Kendall, G. (2011). A hybrid placement strategy for the three-dimensional strip packing problem. European Journal of Operational Research, 209(3), 219–227. doi:10.1016/j.ejor.2010.09.023
   Web of Science ®Google Scholar
• Alonso, M. T., Alvarez-Valdes, R., Iori, M., Parreño, F., & Tamarit, J. M. (2017). Mathematical models for multicontainer loading problems. Omega, 66(Part A), 106–117. doi:10.1016/j.omega.2016.02.002
   Web of Science ®Google Scholar
• Alonso, M., Alvarez-Valdes, R., Parreno, F., & Tamarit, J. (2016). Determining the best shipper sizes for sending products to customers. International Transactions in Operational Research, 23 (1-2), 265–285. doi:10.1111/itor.12128
   Web of Science ®Google Scholar
• Anjos, M. F., & Vieira, M. V. C. (2017). Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions. European Journal of Operational Research, 261(1), 1–16. doi:10.1016/j.ejor.2017.01.049
   Web of Science ®Google Scholar
• Bansal, N., Han, X., Iwama, K., Sviridenko, M., & Zhang, G. (2013). A harmonic algorithm for the 3D strip packing problem. SIAM Journal on Computing, 42(2), 579–592. doi:10.1137/070691607
   Web of Science ®Google Scholar
• Bortfeldt, A., & Mack, D. (2007). A heuristic for the three-dimensional strip packing problem. European Journal of Operational Research, 183(3), 1267–1279. doi:10.1016/j.ejor.2005.07.031
   Web of Science ®Google Scholar
• Bortfeldt, A., & Wäscher, G. (2013). Constraints in container loading - a state-of-the-art review. European Journal of Operational Research, 229(1), 1–20. doi:10.1016/j.ejor.2012.12.006
   Web of Science ®Google Scholar
• Chen, C. S., Lee, S. M., & Shen, Q. S. (1995). An analytical model for the container loading problem. European Journal of Operational Research, 80(1), 68–76. doi:10.1016/0377-2217(94)00002-T
   Web of Science ®Google Scholar
• Czyzyk, J., Mesnier, M. P., & Moré, J. J. (1998). The NEOS server. IEEE Computational Science and Engineering, 5(3), 68–75. doi:10.1109/99.714603
   Web of Science ®Google Scholar
• Dolan, E. D. (2001). The NEOS server 4.0 administrative guide. Mathematics and Computer Science Division, Argonne National Laboratory, ANL/MCS-TM-250.
   Google Scholar
• Dowsland, K. A., Soubeiga, E., & Burke, E. (2007). A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation. European Journal of Operational Research, 179 (3), 759–774. doi:10.1016/j.ejor.2005.03.058
   Web of Science ®Google Scholar
• Egeblad, J., Garavelli, C., Lisi, S., & Pisinger, D. (2010). Heuristics for container loading of furniture. European Journal of Operational Research, 200(3), 881–892. doi:10.1016/j.ejor.2009.01.048
   Web of Science ®Google Scholar
• Egeblad, J., Nielsen, B. K., & Brazil, M. (2009). Translational packing of arbitrary polytopes. Computational Geometry, 42(4), 269–288. doi:10.1016/j.comgeo.2008.06.003
   Web of Science ®Google Scholar
• Faina, L. (2000). A global optimization algorithm for the three-dimensional packing problem. European Journal of Operational Research, 126(2), 340–354. doi:10.1016/S0377-2217(99)00292-1
   Web of Science ®Google Scholar
• Fujiyoshi, K., Kawai, H., & Ishihara, K. (2009). A tree based novel representation for 3D-block packing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28(5), 759–764. doi:10.1109/TCAD.2009.2015424
   Web of Science ®Google Scholar
• Gropp, W., & Moré, J. J. (1997). Optimization environments and the NEOS server. Approximation Theory and Optimization, Cambridge University Press, 167–182.
   Google Scholar
• Hifi, M., Kacem, I., Négre, S., & Wu, L. (2010). A linear programming approach for the three-dimensional bin-packing problem. Electronic Notes in Discrete Mathematics, 36, 993–1000. doi:10.1016/j.endm.2010.05.126
   Google Scholar
• Hopper, E., & Turton, B. C. H. (2001). An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research, 127(1), 34–57. doi:10.1016/S0377-2217(99)00357-4
   Web of Science ®Google Scholar
• Jansen, K., & Solis-Oba, R. (2006). An asymptotic approximation algorithm for 3D-strip packing. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 143–152.
   Google Scholar
• Junqueira, L., & Morabito, R. (2017). On solving three-dimensional open-dimension rectangular packing problems. Engineering Optimization, 49 (5), 733–745. doi:10.1080/0305215X.2016.1208010
   Web of Science ®Google Scholar
• Junqueira, L., Morabito, R., & Sato Yamashita, D. (2012). MIP-based approaches for the container loading problem with multi-drop constraints. Annals of Operations Research, 199(1), 51–75. doi:10.1007/s10479-011-0942-z
   Web of Science ®Google Scholar
• Junqueira, L., Morabito, R., & Sato Yamashita, D. (2012a). Three-dimensional container loading models with cargo stability and load bearing constraints. Computers & Operations Research, 39, 74–85. doi:10.1016/j.cor.2010.07.017
   Web of Science ®Google Scholar
• Lai, K. K., Xue, J., & Xu, B. (1998). Container packing in a multi-customer delivering operation. Computers & Industrial Engineering, 35, 323–326. doi:10.1016/S0360-8352(98)00085-0
   Web of Science ®Google Scholar
• Li, K., & Cheng, K. H. (1992). Heuristic algorithms for on-line packing in three dimensions. Journal of Algorithms, 13 (4), 589–605. doi:10.1016/0196-6774(92)90058-K
   Web of Science ®Google Scholar
• Lim, A., Ma, H., Qiu, C., & Zhu, W. (2013). The single container loading problem with axle weight constraints. International Journal of Production Economics, 144(1), 358–369. doi:10.1016/j.ijpe.2013.03.001
   Web of Science ®Google Scholar
• Miyazawa, F. K., & Wakabayashi, Y. (2000). Approximation algorithms for the orthogonal z-oriented three-dimensional packing. SIAM Journal on Computing, 29 (3), 1008–1029. doi:10.1137/S009753979631391X
   Web of Science ®Google Scholar
• Miyazawa, F. K., & Wakabayashi, Y. (2007). Two- and three-dimensional parametric packing. Computers & Operations Research, 9, 2589–2603. doi:10.1016/j.cor.2005.10.001
   Web of Science ®Google Scholar
• Miyazawa, F. K., & Wakabayashi, Y. (2009). Three-dimensional packings with rotations. Computers & Operations Research, 36, 2801–2815. doi:10.1016/j.cor.2008.12.015
   Web of Science ®Google Scholar
• Padberg, M. (2000). Packing small boxes into a big box. Mathematical Methods of Operations Research (Zor), 52(1), 1–21. doi:10.1007/s001860000066
   Web of Science ®Google Scholar
• Queiroz, T. A., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2012). Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39(2), 200–212. doi:10.1016/j.cor.2011.03.011
   Web of Science ®Google Scholar
• Toffolo, T. A. M., Esprit, E., Wauters, T., & Vanden Berghe, G. (2017). A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. European Journal of Operational Research, 257(2), 526–538. doi:10.1016/j.ejor.2016.07.033
   Web of Science ®Google Scholar
• Tsai, J.-F., & Li, H.-L. (2006). A global optimization method for packing problems. Engineering Optimization, 38 (6), 687–700. doi:10.1080/03052150600603264
   Web of Science ®Google Scholar
• Tsai, J.-F., Wang, P.-C., & Lin, M.-H. (2015). A global optimization approach for solving three-dimensional open dimension rectangular packing problems. Optimization, 64(12), 2601–2618. doi:10.1080/02331934.2013.877906
   Web of Science ®Google Scholar
• Vielma, J. P., & Nemhauser, G. L. (2011). Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Mathematical Programming, 128 (1-2), 49–72. doi:10.1007/s10107-009-0295-4
   Web of Science ®Google Scholar
• Wäscher, G., Haußner, H., & Schumann, H. (2007). Improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109–1130. doi:10.1016/j.ejor.2005.12.047
   Web of Science ®Google Scholar
• Wu, Y., Li, W., Goh, M., & de Souza, R. (2010). Three-dimensional bin packing problem with variable bin height. European Journal of Operational Research, 202(2), 347–355. doi:10.1016/j.ejor.2009.05.040
   Web of Science ®Google Scholar
• Zhao, X., Bennell, J. A., Bektaş, T., & Dowsland, K. (2016). A comparative review of 3D container loading algorithms. International Transactions in Operational Research, 23(1–2), 287–320. doi:10.1111/itor.12094
   Web of Science ®Google Scholar