Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting

References

• Belov G., Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. (2002) 141:274–294Crossref, Google Scholar
• Belov G., Scheithauer G. The number of setups (different patterns) in one-dimensional stock cutting. (2003) . Technical report, Institute of Numerical Mathematics, Technische Universität DresdenGoogle Scholar
• Belov G., Scheithauer G. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. (2006) 171(1):85–106Crossref, Google Scholar
• Degraeve Z., Peeters M. Optimal integer solutions to industrial cutting-stock problems: Part 2, Benchmark results. INFORMS J. Comput. (2003) 15:58–81Link, Google Scholar
• Falkenauer E. A hybrid grouping genetic algorithm for bin packing. J. Heuristics (1996) 2:5–30Crossref, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting-stock problem. Oper. Res. (1961) 9:849–859Link, Google Scholar
• Haessler R. W. Controlling cutting pattern changes in one-dimensional trim problems. Oper. Res. (1975) 23:483–493Link, Google Scholar
• Johnson M. P., Rennick C., Zak E. One-dimensional cutting stock problem in just-in-time environment. Pesquisa Operacional (1999) 19:145–158Google Scholar
• Johnston R. E., Sadinlija E. A new model for complete solutions to one-dimensional stock problems. Eur. J. Oper. Res. (2004) 153:176–183Crossref, Google Scholar
• Kupke J.Lösung von ganzzahligen Verschnittproblemen mit Branch-and-Price (1998) . Diplomarbeit, Institut für Informatik, Universität zu Köln, Köln, GermanyGoogle Scholar
• Mukhacheva E. A., Zalgaller V. A. Linear programming for cutting problems. Internat. J. Software Engrg. Knowledge Engrg. (1993) 3:463–477Crossref, Google Scholar
• Nitsche C., Scheithauer G., Terno J. Tighter relaxations for the cutting stock problem. Eur. J. Oper. Res. (1999) 112:654–663Crossref, Google Scholar
• Peeters M. One-dimensional cutting and packing: New problems and algorithms. (2002) . Ph.D. thesis, Faculty of Economics and Applied Economics, Katholieke Universiteit Leuven, BelgiumGoogle Scholar
• Rietz J. Investigations of MIRUP for vector packing problems. (2003) . Ph.D. thesis, Institute of Numerical Mathematics and Optimization, Freiberg University, Freiberg, GermanyGoogle Scholar
• Scheithauer G., Terno J. The modified integer round-up property of the one-dimensional cutting stock problem. Eur. J. Oper. Res. (1995) 84:562–571Crossref, Google Scholar
• Schreck H. A sequence problem in practical trim optimization. Proc. Sixteenth Triennial Conf. Internat. Federation of Oper. Res. Soc. (2002) (IFORS, Edinburgh, UK) 121Google Scholar
• Vahrenkamp R. Random search in the one-dimensional cutting stock problem. Eur. J. Oper. Res. (1996) 95:191–200Crossref, Google Scholar
• Valério de Carvalho J. M. V. Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. (1999) 86:629–659Crossref, Google Scholar
• Yanasse H. H., Becceneri J. C., Soma N. Y. Bounds for a problem of sequencing patterns. Pesquisa Operacional (1999) 19:249–278Google Scholar
• Yuen B. J. Heuristics for sequencing cutting patterns. Eur. J. Oper. Res. (1991) 55:183–190Crossref, Google Scholar