A column generation procedure for gang-rip saw arbor design and scheduling

REFERENCES

• ATKINS , D. R. , GRANOT , D. , and RAGHAVENDRA , B. G. 1984 , Application of Mathematical Programming to the Plywood Design and Manufacturing Problem. Management Science , 30 , 1424 – 1441 .
   Web of Science ®Google Scholar
• BEASLEY , J. E. 1985 , An algorithm for the two-dimensional assortment problem . European Journal of Operational Research , |v19 ( 2 ), 253 – 261 .
   Web of Science ®Google Scholar
• DYCKHOFF , H. , and FINKE , U. 1992 , Cutting and Packing in Production and Distribution ( Heidelberg , Germany Physica-Verlag ).
   Google Scholar
• ENG , G. , and DAELLENBACH , H. G. 1985 , Forrest outturn optimization by Dantzig-Wolfe decomposition and dynamic programming column generation . Operations Research , 33 , 459 – 464 .
   Web of Science ®Google Scholar
• FARLEY , A. A. 1988 , Mathematical programming models for cutting stock problems in the clothing industry. Journal of Operational Research Society , |v39 ( 1 ), 41 – 53 .
   Web of Science ®Google Scholar
• FARLEY , A. A. 1990 , The cutting stock problem in canvas industry , European Journal of Operational Research , 44 , 247 – 255 .
   Web of Science ®Google Scholar
• FERREIRA , J. S. , NEVES , M. A. ,FONSECA ECASTRO , P. 1990 , A two-phase roll cutting problem. European Journal of Operational Research , 44 , 185 – 196 .
   Web of Science ®Google Scholar
• FATHI , Y. , and KEGLER , S. R. 1992 , Saw arbor generation and scheduling for computer-assisted gang-rip systems . Technical Report 264 , Graduate Program in Operations Research , North Carolina State University , Raleigh , NC .
   Google Scholar
• GILMORE , P. , and GOMORY , R. 1961 , A linear programming approach to the cutting stock problem Part I . Operations Research , 9 , 849 – 859 .
   Web of Science ®Google Scholar
• GILMORE , P. , and GOMORY , R. 1963 , A linear programming approach to the cutting stock problem Part II . Operations Research , 23 , 483 – 493 .
   Google Scholar
• HAESSLER , R. W. 1975 , Controlling pattern changes in one-dimensional cutting stock problems . Operations Research , 23 , 483 – 493 .
   Web of Science ®Google Scholar
• HAESSLER , R. W. 1978 , A procedure for solving the 1.5-dimensional coil slitting problem. Transactions of the AIIE , |v10 (1), 70 – 75 .
   Google Scholar
• MARTELLO , S. , and TOTH , P. 1990 . Knapsack Problems ( New York Wiley ).
   Google Scholar
• MURTY , K. G. 1983. Linear Programming (New York Wiley).
   Google Scholar
• ROODMAN , G. M. 1986 , Near-optimal solutions to one-dimensional cutting stock problem . Computers and Operations Research , 13 , 713 – 719 .
   Web of Science ®Google Scholar
• SUMICHRAST , R. T. 1986 , A new cutting-stock heuristic for scheduling production . Computers and Operations Research , 13 , 403 – 410 .
   Web of Science ®Google Scholar
• WINSTON , W. L. 1991 , Operations Research Applications and Algorithms ( Boston , MA PWS-Kent Publishing ).
   Google Scholar