메뉴 건너뛰기




Volumn 33, Issue 6, 2006, Pages 1505-1520

Generating optimal two-section cutting patterns for rectangular blanks

Author keywords

Cutting stock problem; Guillotine; Optimization; Two dimensional cutting

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL METHODS; INVENTORY CONTROL; OPTIMIZATION; PROBLEM SOLVING;

EID: 27344437910     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.09.022     Document Type: Article
Times cited : (20)

References (12)
  • 1
    • 0036566942 scopus 로고    scopus 로고
    • A new upper bound for unconstrained two-dimensional cutting and packing
    • G. Young-Gun, and M-K. Kang A new upper bound for unconstrained two-dimensional cutting and packing Journal of the Operational Research Society 53 2002 587 591
    • (2002) Journal of the Operational Research Society , vol.53 , pp. 587-591
    • Young-Gun, G.1    Kang, M.-K.2
  • 3
    • 0001648565 scopus 로고
    • The theory and computation of knapsack functions
    • P.C. Gilmore, and R.E. Gomory The theory and computation of knapsack functions Operations Research 14 1966 1045 1074
    • (1966) Operations Research , vol.14 , pp. 1045-1074
    • Gilmore, P.C.1    Gomory, R.E.2
  • 4
    • 0022043635 scopus 로고
    • Algorithms for unconstrained two-dimensional guillotine cutting
    • J.E. Beasley Algorithms for unconstrained two-dimensional guillotine cutting Journal of the Operational Research Society 36 1985 297 306
    • (1985) Journal of the Operational Research Society , vol.36 , pp. 297-306
    • Beasley, J.E.1
  • 5
    • 0000026164 scopus 로고
    • Recursive computational procedure for two-dimensional stock cutting
    • J.C. Herz Recursive computational procedure for two-dimensional stock cutting IBM Journal of Research and Development 16 1972 462 469
    • (1972) IBM Journal of Research and Development , vol.16 , pp. 462-469
    • Herz, J.C.1
  • 6
    • 0002893433 scopus 로고
    • An algorithm for two-dimensional cutting problems
    • N. Christofides, and C. Whitlock An algorithm for two-dimensional cutting problems Operations Research 25 1977 30 44
    • (1977) Operations Research , vol.25 , pp. 30-44
    • Christofides, N.1    Whitlock, C.2
  • 8
    • 0035089193 scopus 로고    scopus 로고
    • Exact algorithms for large-scale unconstrained two and three staged cutting problems
    • M. Hifi Exact algorithms for large-scale unconstrained two and three staged cutting problems Computational Optimization and Applications 18 2001 63 88
    • (2001) Computational Optimization and Applications , vol.18 , pp. 63-88
    • Hifi, M.1
  • 9
    • 0000954920 scopus 로고
    • An approximation algorithm for solving unconstrained two-dimensional knapsack problems
    • D. Fayard, and V. Zissimopoulos An approximation algorithm for solving unconstrained two-dimensional knapsack problems European Journal of Operational Research 84 1995 618 632
    • (1995) European Journal of Operational Research , vol.84 , pp. 618-632
    • Fayard, D.1    Zissimopoulos, V.2
  • 11
    • 0002662534 scopus 로고
    • Multistage cutting stock problems of two and more dimensions
    • P.C. Gilmore, and R.E. Gomory Multistage cutting stock problems of two and more dimensions Operations Research 13 1965 94 120
    • (1965) Operations Research , vol.13 , pp. 94-120
    • Gilmore, P.C.1    Gomory, R.E.2
  • 12
    • 0031074995 scopus 로고    scopus 로고
    • The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
    • M. Hifi The DH/KD algorithm a hybrid approach for unconstrained two-dimensional cutting problems European Journal of Operational Research 97 1997 41 52
    • (1997) European Journal of Operational Research , vol.97 , pp. 41-52
    • Hifi, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.