On the one-dimensional stock cutting problem in the paper tube industry

Journal of Scheduling

Volumn 14, Issue 3, 2011, Pages 281-290

  Matsumoto, Kazuki ^a   Umetani, Shunji ^b   Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

Local search; One dimensional cutting stock problem; Open stack; Paper tube industry; Tabu search

Indexed keywords

BIN PACKING PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; CUTTING PATTERNS; CUTTING PROCESS; LOCAL SEARCH; ONE-DIMENSIONAL CUTTING STOCK PROBLEM; OPEN STACK; PAPER TUBE INDUSTRY; PAPER TUBES; PRIMARY OBJECTIVE; QUALITY OF SOLUTION; SEMI-AUTOMATED; STOCK CUTTING PROBLEM; TABU SEARCH ALGORITHMS; TOTAL LENGTH; UPPER BOUND;

BINS; COMBINATORIAL OPTIMIZATION; CUTTING; CUTTING TOOLS; HEURISTIC ALGORITHMS; INDUSTRIAL APPLICATIONS; INDUSTRY; TABU SEARCH;

TUBES (COMPONENTS);

EID: 79958148791     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-010-0164-2     Document Type: Article

References (27)

1. J. C. Becceneri H. H. Yanasse N. Y. Soma 2004 A method for solving the minimization of the maximum number of open stacks problem within a cutting process Computers and Operations Research 31 2315 2332 10.1016/S0305-0548(03) 00189-8
2. Belov, G.; & Scheithauer, G. (2003). The number of setups (different patterns) in one-dimensional stock cutting (Technical Report). Institute of Numerical Mathematics, Technische Universität Dresden.
3. G. Belov G. Scheithauer 2006 A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional stock cutting and two-dimensional two-stage cutting European Journal of Operational Research 171 85 106 10.1016/j.ejor.2004.08.036 (Pubitemid 41690029)
4. G. Belov G. Scheithauer 2007 Setup and open-stacks minimization in one-dimensional stock cutting INFORMS Journal on Computing 19 27 35 10.1287/ijoc.1050.0132
5. Z. Degraeve M. Peeters 2003 Optimal integer solutions to industrial cutting-stock problems: part 2, benchmark results INFORMS Journal on Computing 15 58 81 10.1287/ijoc.15.1.58.15156 (Pubitemid 39042733)
6. Z. Degraeve L. Schrage 1999 Optimal integer solutions to industrial cutting stock problems INFORMS Journal on Computing 11 406 419 10.1287/ijoc.11.4.406
7. A. Fink S. Vo 1999 Applications of modern heuristic search methods to pattern sequencing problems Computers and Operations Research 26 17 34 10.1016/S0305-0548(98)80001-4 (Pubitemid 29346485)
8. H. Foerster G. Wäscher 1998 Simulated annealing for order spread minimization in sequencing cutting patterns European Journal of Operational Research 110 272 281 10.1016/S0377-2217(97)00257-9 (Pubitemid 128387405)
9. H. Foerster G. Wäscher 2000 Pattern reduction in one-dimensional cutting stock problems International Journal of Production Research 38 1657 1676 10.1080/002075400188780 (Pubitemid 35395510)
10. Garey, M. R.; & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP -completeness. New York: Freeman.
11. T. Gau G. Wäscher 1995 CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem European Journal of Operational Research 84 572 579 10.1016/0377-2217(95)00023-J
12. P. C. Gilmore R. E. Gomory 1961 A linear programming approach to the cutting-stock problem Operations Research 9 849 859 10.1287/opre.9.6.849
13. P. C. Gilmore R. E. Gomory 1963 A linear programming approach to the cutting-stock problem-part 2 Operations Research 11 863 888 10.1287/opre.11.6. 863
14. R. E. Haessler 1971 A heuristic programming solution to a nonlinear cutting stock problem Management Science 17 793 802 10.1287/mnsc.17.12.B793
15. R. E. Haessler 1975 Controlling cutting pattern changes in one-dimensional trim problems Operations Research 23 483 493 10.1287/opre.23.3.483
16. O. B. G. Madsen 1988 An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry Journal of the Operational Research Society 39 249 256
17. Makhorin, A. (2000). GLPK (GNU Linear Programming Kit). http://www.gnu.org/software/glpk/.
18. Umetani, S. (2009). Test instances for the paper tube cutting stock problem. http://www-sys.ist.osaka-u.ac.jp/~umetani/index-e.html.
19. S. Umetani M. Yagiura T. Ibaraki 2003 One-dimensional cutting stock problem to minimize the number of different patterns European Journal of Operational Research 146 388 402 10.1016/S0377-2217(02)00239-4
20. S. Umetani M. Yagiura T. Ibaraki 2006 One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming Journal of Mathematical Modeling and Algorithms 5 43 64 10.1007/s10852-005-9031-0 (Pubitemid 43473949)
21. P. H. Vance 1998 Branch-and-price algorithms for the one-dimensional cutting stock problem Computational Optimization and Applications 9 211 228 10.1023/A:1018346107246
22. F. Vanderbeck 1999 Computational study of a column generation algorithm for bin packing and cutting stock problems Mathematical Programming A86 565 594 10.1007/s101070050105
23. H. H. Yanasse 1997 On a pattern sequencing problem to minimize the maximum number of open stacks European Journal of Operational Research 100 454 463 10.1016/S0377-2217(97)84107-0 (Pubitemid 127392369)
24. H. H. Yanasse M. J. P. Lamosa 2007 An integrated cutting stock and sequencing problem European Journal of Operational Research 183 1353 1370 10.1016/j.ejor.2005.09.054 (Pubitemid 47033912)
25. B. J. Yuen 1991 Heuristics for sequencing cutting patterns European Journal of Operational Research 55 183 190 10.1016/0377-2217(91)90222-H
26. B. J. Yuen 1995 Improved heuristics for sequencing cutting patterns European Journal of Operational Research 87 57 64 10.1016/0377-2217(94)00068-N
27. B. J. Yuen K. V. Richardson 1995 Establishing the optimality of sequencing heuristics for cutting stock problems European Journal of Operational Research 84 590 598 10.1016/0377-2217(95)00025-L