Dynamic programming and mixed integer programming based algorithms for the online glass cutting problem with defects and production targets

References

• Aboudi, R., and P. Barcia. 1998. “Determining Cutting Stock Patterns When Defects Are Present.” Annals of Operations Research 82: 343–354.10.1023/A:1018975006313
   Web of Science ®Google Scholar
• Afsharian, M., A. Niknejad, and G. Wäscher. 2014. “A Heuristic, Dynamic Programming-based Approach for a Two-dimensional Cutting Problem with Defects.” OR Spectrum 36 (4): 971–999.10.1007/s00291-014-0363-x
   Web of Science ®Google Scholar
• Bischoff, E. E., and G. Wäscher. 1995. “Cutting and Packing.” European Journal of Operational Research 84: 503–505.10.1016/0377-2217(95)00018-L
   Web of Science ®Google Scholar
• Carnieri, C., G. A. Mendoza, and W. G. Luppold. 1993. “Optimal Cutting of Dimension Parts from Lumber with a Defect: A Heuristic Solution Procedure.” Forest Products Journal 43 (9): 66–72.
   Web of Science ®Google Scholar
• Faaland, B., and D. Briggs. 1984. “Log Bucking and Lumber Manufacturing Using Dynamic Programming.” Management Science 30: 245–257.10.1287/mnsc.30.2.245
   Web of Science ®Google Scholar
• de Gelder, E. R., and A. P. M. Wagelmans. 2009. “The Two-dimensional Cutting Stock Problem within the Roller Blind Production Process.” Statistica Neerlandica 63 (4): 474–489.10.1111/stan.2009.63.issue-4
   Web of Science ®Google Scholar
• Ghodsi, R., and F. Sassani. 2005. “Real-time Optimum Sequencing of Wood Cutting Process.” International Journal of Production Research 43 (6): 1127–1141.10.1080/00207540412331299684
   Web of Science ®Google Scholar
• Gilmore, P. C., and R. E. Gomory. 1965. “Multistage Cutting Stock Problems of Two and More Dimensions.” Operations Research 13: 94–120.10.1287/opre.13.1.94
   Web of Science ®Google Scholar
• Gilmore, P. C., and R. E. Gomory. 1966. “The Theory and Computation of Knapsack Functions.” Operations Research 14: 1045–1074.10.1287/opre.14.6.1045
   Web of Science ®Google Scholar
• Hahn, S. G. 1968. “On the Optimal Cutting of Defective Sheets.” Operations Research 16: 1100–1114.10.1287/opre.16.6.1100
   Web of Science ®Google Scholar
• Huang, Y. S., S. A. Wang, and C. C. Fang. 2017. “Optimization of the LCD Optical Film Cutting Problem.” International Journal of Production Research 55 (15): 4411–4435.10.1080/00207543.2016.1256507
   Web of Science ®Google Scholar
• Karp, R. M. 1972. “Reducibility among Combinatorial Problems.” In Complexity of Computer Computations, edited by R. E. Miller and J. W. Thatcher, 85–103. New York: Plenum.10.1007/978-1-4684-2001-2
   Google Scholar
• Kim, B. I., Y. Ki, D. Son, B. Bae, and J. S. Park. 2016. “An Algorithm for a Cutting Problem in Window Frame Production.” International Journal of Production Research 54 (14): 4327–4339.10.1080/00207543.2016.1148279
   Web of Science ®Google Scholar
• Neidlein, V., A. C. G. Vianna, M. N. Arenales, and G. Wäscher. 2009. “Two-dimensional Guillotineable-layout Cutting Problems with a Single Defect – An AND/OR-graph Approach.” Operations Research Proceedings 2008 Part 3, edited by B. Fleischmann, K.-H. Borgwardt, R. Klein, and A. Tuma, 85–90. Berlin-Heidelberg: Springer.
   Google Scholar
• Ozdamar, L. 2000. “The Cutting-wrapping Problem in the Textile Industry: Optimal Overlap of Fabric Lengths and Defects for Maximizing Return Based on Quality.” International Journal of Production Research 38 (6): 1287–1309.10.1080/002075400188852
   Web of Science ®Google Scholar
• Russo, M., A. Sforza, and C. Sterle. 2013. “An Improvement of the Knapsack Function Based Algorithm of Gilmore and Gomory for the Unconstrained Two-dimensional Guillotine Cutting Problem.” International Journal of Production Economics 145: 451–462.10.1016/j.ijpe.2013.04.031
   Web of Science ®Google Scholar
• Russo, M., A. Sforza, and C. Sterle. 2014. “An Exact Dynamic Programming Algorithm for Large-scale Unconstrained Two-dimensional Guillotine Cutting Problems.” Computers & Operations Research 50: 97–114.10.1016/j.cor.2014.04.001
   Web of Science ®Google Scholar
• Sarker, B. R. 1988. “An Optimum Solution for One-dimensional Slitting Problems: A Dynamic Programming Approach.” Journal of the Operational Research Society 39: 749–755.10.1057/jors.1988.130
   Web of Science ®Google Scholar
• Scheithauer, G., and J. Terno. 1988. “Guillotine Cutting of Defective Boards.” Optimization 19: 111–121.10.1080/02331938808843323
   Google Scholar
• Sculli, D. 1981. “A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape.” Management Science 27 (8): 946–952.10.1287/mnsc.27.8.946
   Web of Science ®Google Scholar
• Sweeney, P., and R. W. Haessler. 1990. “One-dimensional Cutting Stock Decisions for Rolls with Multiple Quality Grades.” European Journal of Operational Research 44: 224–231.10.1016/0377-2217(90)90357-H
   Web of Science ®Google Scholar
• Trigos, F., and E. M. López. 2017. “A Vulcanising Decision Planning as a Particular One-dimensional Cutting Stock Problem with Limited Part-related Tooling in Make-to-order Industrial Environments.” International Journal of Production Research 55 (10): 2881–2896.10.1080/00207543.2016.1227100
   Web of Science ®Google Scholar
• Tuzun Aksu, D., and B. Durak. 2016. “A Dynamic Programming Algorithm for the Online Cutting Problem with Defects and Quality Grades.” IFAC-PapersOnLine 49 (12): 17–22.10.1016/j.ifacol.2016.07.543
   Google Scholar
• Wäscher, G., H. Haussner, and H. Schumann. 2007. “An Improved Typology of Cutting and Packing Problems.” European Journal of Operational Research 183: 1109–1130.10.1016/j.ejor.2005.12.047
   Web of Science ®Google Scholar
• Wenshu, L., M. Dan, and W. Jinzhuo. 2015. “Study on Cutting Stock Optimization for Decayed Wood Board Based on Genetic Algorithm.” The Open Automation Control Systems Journal 7: 284–289.10.2174/1874444301507010284
   Google Scholar