메뉴 건너뛰기




Volumn 33, Issue 12, 2001, Pages 879-891

A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms

Author keywords

2 D cutting; Genetic algorithm; Nesting

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CUTTING; DYNAMIC PROGRAMMING; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PARALLEL PROCESSING SYSTEMS;

EID: 0035498588     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(00)00112-3     Document Type: Article
Times cited : (87)

References (21)
  • 1
    • 0022043635 scopus 로고
    • Algorithms for unconstrained two-dimensional guillotine cutting
    • (1985) J Oper Res Soc , vol.36 , Issue.4 , pp. 297-306
    • Beasley, J.E.1
  • 5
    • 0023828969 scopus 로고
    • Mathematical programming models for cutting-stock problems in the clothing industry
    • (1988) J Oper Res Soc , vol.39 , Issue.1 , pp. 41-53
    • Farley, A.A.1
  • 20
    • 0027306252 scopus 로고
    • Development of a vision system for the flexible packing of random shapes
    • Machine Vision Appl, Architect Sys Integration
    • (1992) Proc SPIE , vol.1823 , pp. 223-232
    • Whelan, P.F.1    Batchelor, B.G.2


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