How to cite this paper
Bertolini, M., Mezzogori, D & Zammori, F. (2024). Hybrid heuristic for the one-dimensional cutting stock problem with usable leftovers and additional operating constraints.International Journal of Industrial Engineering Computations , 15(1), 149-170.
Refrences
Abuhassan, I.A., & Nasereddin, H.H. (2011) Cutting stock problem: solution behaviors. International Journal of Research and Reviews in Applied Sciences 6(4).
Alvim, A. C., Ribeiro, C. C., Glover, F., & Aloise, D. J. (2004). A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10, 205-229.
Balogh, J., Békési, J., Dósa, G., Sgall, J., & Stee, R. V. (2014, December). The optimal absolute ratio for online bin packing. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms (pp. 1425-1438). Society for Industrial and Applied Mathematics.
Benjaoran, V., & Bhokha, S. (2014). Three-step solutions for cutting stock problem of construction steel bars. KSCE Journal of Civil Engineering, 18, 1239-1247.
Bertolini, M., Braglia, M., Marrazzini, L., & Neroni, M. (2022). Project Time Deployment: a new lean tool for losses analysis in Engineer-to-Order production environments. International Journal of Production Research, 60(10), 3129-3146.
Bertolini, M., Mezzogori, D., & Zammori, F. (2019). Comparison of new metaheuristics, for the solution of an integrated jobs-maintenance scheduling problem. Expert Systems with Applications, 122, 118-136.
Bhatia, A. K., Hazra, M., & Basu, S. K. (2009, March). Better-fit heuristic for one-dimensional bin-packing problem. In 2009 IEEE International Advance Computing Conference (pp. 193-196). IEEE.
Cheng, C. H., Feiring, B. R., & Cheng, T. C. E. (1994). The cutting stock problem—a survey. International Journal of Production Economics, 36(3), 291-305.
Cherri, A. C., Arenales, M. N., & Yanasse, H. H. (2009). The one-dimensional cutting stock problem with usable leftover–A heuristic approach. European Journal of Operational Research, 196(3), 897-908.
Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191(1), 61-85.
Crainic, T. G., Perboli, G., Pezzuto, M., & Tadei, R. (2007). Computing the asymptotic worst-case of bin packing lower bounds. European journal of operational research, 183(3), 1295-1303.
Cui, Y., & Yang, Y. (2010). A heuristic for the one-dimensional cutting stock problem with usable leftover. European Journal of Operational Research, 204(2), 245-250.
Delorme, M., Iori, M., & Martello, S. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255(1), 1-20.
Erhard, M. (2021). Flexible staffing of physicians with column generation. Flexible Services and Manufacturing Journal, 33(1), 212-252.
Fleszar, K., & Charalambous, C. (2011). Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. European Journal of Operational Research, 210(2), 176-184.
Garraffa, M., Salassa, F., Vancroonenburg, W., Vanden Berghe, G., & Wauters, T. (2016). The one‐dimensional cutting stock problem with sequence‐dependent cut losses. International Transactions in Operational Research, 23(1-2), 5-24.
Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting-stock problem. Operations research, 9(6), 849-859.
Gilmore, P. C., & Gomory, R. E. (1963). A linear programming approach to the cutting stock problem—Part II. Operations research, 11(6), 863-888.
Haessler, R. W. (1975). Controlling cutting pattern changes in one-dimensional trim problems. Operations Research, 23(3), 483-493.
Haessler, R. W., & Sweeney, P. E. (1991). Cutting stock problems and solution procedures. European Journal of Operational Research, 54(2), 141-150.
Jahromi, M. H., Tavakkoli-Moghaddam, R., Makui, A., & Shamsi, A. (2012). Solving an one-dimensional cutting stock problem by simulated annealing and tabu search. Journal of Industrial Engineering International, 8, 1-8.
Javanshir, H., Rezaei, S., Najar, S. S., & Ganji, S. S. (2010). Two dimensional cutting stock management in fabric industries and optimizing the large object’s length. Journal of Research and Reviews in Applied Sciences, 4(3), 243-249.
Kämpke, T. (1988). Simulated annealing: Use of a new tool in bin packing. Annals of Operations Research, 16, 327-332.
Kantorovich, L. V. (1960). Mathematical methods of organizing and planning production. Management science, 6(4), 366-422.
Kirkpatrick, S., Gelatt, C.D., & Vecchi, M.P. (1983). Optimization by simulated annealing. Science, 220, 671-680.
Kokten, E. S., & Sel, Ç. (2022). A cutting stock problem in the wood products industry: a two‐stage solution approach. International Transactions in Operational Research, 29(2), 879-907.
Levine, J., & Ducatelle, F. (2004). Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research society, 55(7), 705-716.
Liang, K. H., Yao, X., Newton, C., & Hoffman, D. (2002). A new evolutionary approach to cutting stock problems with and without contiguity. Computers & Operations Research, 29(12), 1641-1659.
Loh, K. H., Golden, B., & Wasil, E. (2008). Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research, 35(7), 2283-2291.
Lübbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations research, 53(6), 1007-1023.
Martello, S., & Toth, P. (1990a). Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc.
Martello, S., & Toth, P. (1990b). Lower bounds and reduction procedures for the bin packing problem. Discrete applied mathematics, 28(1), 59-70.
Osogami, T., & Okano, H. (2003). Local search algorithms for the bin packing problem and their relationships to various construction heuristics. Journal of Heuristics, 9(1), 29-49.
Quiroz-Castellanos, M., Cruz-Reyes, L., Torres-Jimenez, J., Gómez, C., Huacuja, H. J. F., & Alvim, A. C. (2015). A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Computers & Operations Research, 55, 52-64.
Roodman, G. M. (1986). Near-optimal solutions to one-dimensional cutting stock problems. Computers & operations research, 13(6), 713-719.
Sim, K., & Hart, E. (2013, July). Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model. In Proceedings of the 15th annual conference on Genetic and evolutionary computation (pp. 1549-1556).
Sweeney, P. E., & Paternoster, E. R. (1992). Cutting and packing problems: a categorized, application-orientated research bibliography. Journal of the Operational Research Society, 43(7), 691-706.
Ülker, Ö., Korkmaz, E. E., & Özcan, E. (2008, September). A grouping genetic algorithm using linear linkage encoding for bin packing. In International Conference on Parallel Problem Solving from Nature (pp. 1140-1149). Berlin, Heidelberg: Springer Berlin Heidelberg.
Vahrenkamp, R. (1996). Random search in the one-dimensional cutting stock problem. European Journal of Operational Research, 95(1), 191-200.
Wilhelm, W. E. (1999). A column-generation approach for the assembly system design problem with tool changes. International Journal of Flexible Manufacturing Systems, 11, 177-205.
Wilhelm, W. E. (2001). A technical review of column generation in integer programming. Optimization and Engineering, 2, 159-200.
Zammori, F., Neroni, M., & Mezzogori, D. (2021). Cycle time calculation of shuttle-lift-crane automated storage and retrieval system. IISE Transactions, 54(1), 40-59.
Alvim, A. C., Ribeiro, C. C., Glover, F., & Aloise, D. J. (2004). A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10, 205-229.
Balogh, J., Békési, J., Dósa, G., Sgall, J., & Stee, R. V. (2014, December). The optimal absolute ratio for online bin packing. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms (pp. 1425-1438). Society for Industrial and Applied Mathematics.
Benjaoran, V., & Bhokha, S. (2014). Three-step solutions for cutting stock problem of construction steel bars. KSCE Journal of Civil Engineering, 18, 1239-1247.
Bertolini, M., Braglia, M., Marrazzini, L., & Neroni, M. (2022). Project Time Deployment: a new lean tool for losses analysis in Engineer-to-Order production environments. International Journal of Production Research, 60(10), 3129-3146.
Bertolini, M., Mezzogori, D., & Zammori, F. (2019). Comparison of new metaheuristics, for the solution of an integrated jobs-maintenance scheduling problem. Expert Systems with Applications, 122, 118-136.
Bhatia, A. K., Hazra, M., & Basu, S. K. (2009, March). Better-fit heuristic for one-dimensional bin-packing problem. In 2009 IEEE International Advance Computing Conference (pp. 193-196). IEEE.
Cheng, C. H., Feiring, B. R., & Cheng, T. C. E. (1994). The cutting stock problem—a survey. International Journal of Production Economics, 36(3), 291-305.
Cherri, A. C., Arenales, M. N., & Yanasse, H. H. (2009). The one-dimensional cutting stock problem with usable leftover–A heuristic approach. European Journal of Operational Research, 196(3), 897-908.
Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191(1), 61-85.
Crainic, T. G., Perboli, G., Pezzuto, M., & Tadei, R. (2007). Computing the asymptotic worst-case of bin packing lower bounds. European journal of operational research, 183(3), 1295-1303.
Cui, Y., & Yang, Y. (2010). A heuristic for the one-dimensional cutting stock problem with usable leftover. European Journal of Operational Research, 204(2), 245-250.
Delorme, M., Iori, M., & Martello, S. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255(1), 1-20.
Erhard, M. (2021). Flexible staffing of physicians with column generation. Flexible Services and Manufacturing Journal, 33(1), 212-252.
Fleszar, K., & Charalambous, C. (2011). Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. European Journal of Operational Research, 210(2), 176-184.
Garraffa, M., Salassa, F., Vancroonenburg, W., Vanden Berghe, G., & Wauters, T. (2016). The one‐dimensional cutting stock problem with sequence‐dependent cut losses. International Transactions in Operational Research, 23(1-2), 5-24.
Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting-stock problem. Operations research, 9(6), 849-859.
Gilmore, P. C., & Gomory, R. E. (1963). A linear programming approach to the cutting stock problem—Part II. Operations research, 11(6), 863-888.
Haessler, R. W. (1975). Controlling cutting pattern changes in one-dimensional trim problems. Operations Research, 23(3), 483-493.
Haessler, R. W., & Sweeney, P. E. (1991). Cutting stock problems and solution procedures. European Journal of Operational Research, 54(2), 141-150.
Jahromi, M. H., Tavakkoli-Moghaddam, R., Makui, A., & Shamsi, A. (2012). Solving an one-dimensional cutting stock problem by simulated annealing and tabu search. Journal of Industrial Engineering International, 8, 1-8.
Javanshir, H., Rezaei, S., Najar, S. S., & Ganji, S. S. (2010). Two dimensional cutting stock management in fabric industries and optimizing the large object’s length. Journal of Research and Reviews in Applied Sciences, 4(3), 243-249.
Kämpke, T. (1988). Simulated annealing: Use of a new tool in bin packing. Annals of Operations Research, 16, 327-332.
Kantorovich, L. V. (1960). Mathematical methods of organizing and planning production. Management science, 6(4), 366-422.
Kirkpatrick, S., Gelatt, C.D., & Vecchi, M.P. (1983). Optimization by simulated annealing. Science, 220, 671-680.
Kokten, E. S., & Sel, Ç. (2022). A cutting stock problem in the wood products industry: a two‐stage solution approach. International Transactions in Operational Research, 29(2), 879-907.
Levine, J., & Ducatelle, F. (2004). Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research society, 55(7), 705-716.
Liang, K. H., Yao, X., Newton, C., & Hoffman, D. (2002). A new evolutionary approach to cutting stock problems with and without contiguity. Computers & Operations Research, 29(12), 1641-1659.
Loh, K. H., Golden, B., & Wasil, E. (2008). Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research, 35(7), 2283-2291.
Lübbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations research, 53(6), 1007-1023.
Martello, S., & Toth, P. (1990a). Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc.
Martello, S., & Toth, P. (1990b). Lower bounds and reduction procedures for the bin packing problem. Discrete applied mathematics, 28(1), 59-70.
Osogami, T., & Okano, H. (2003). Local search algorithms for the bin packing problem and their relationships to various construction heuristics. Journal of Heuristics, 9(1), 29-49.
Quiroz-Castellanos, M., Cruz-Reyes, L., Torres-Jimenez, J., Gómez, C., Huacuja, H. J. F., & Alvim, A. C. (2015). A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Computers & Operations Research, 55, 52-64.
Roodman, G. M. (1986). Near-optimal solutions to one-dimensional cutting stock problems. Computers & operations research, 13(6), 713-719.
Sim, K., & Hart, E. (2013, July). Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model. In Proceedings of the 15th annual conference on Genetic and evolutionary computation (pp. 1549-1556).
Sweeney, P. E., & Paternoster, E. R. (1992). Cutting and packing problems: a categorized, application-orientated research bibliography. Journal of the Operational Research Society, 43(7), 691-706.
Ülker, Ö., Korkmaz, E. E., & Özcan, E. (2008, September). A grouping genetic algorithm using linear linkage encoding for bin packing. In International Conference on Parallel Problem Solving from Nature (pp. 1140-1149). Berlin, Heidelberg: Springer Berlin Heidelberg.
Vahrenkamp, R. (1996). Random search in the one-dimensional cutting stock problem. European Journal of Operational Research, 95(1), 191-200.
Wilhelm, W. E. (1999). A column-generation approach for the assembly system design problem with tool changes. International Journal of Flexible Manufacturing Systems, 11, 177-205.
Wilhelm, W. E. (2001). A technical review of column generation in integer programming. Optimization and Engineering, 2, 159-200.
Zammori, F., Neroni, M., & Mezzogori, D. (2021). Cycle time calculation of shuttle-lift-crane automated storage and retrieval system. IISE Transactions, 54(1), 40-59.