Research on the system of computer-aid cutting-stock

被引:0
|
作者
Chen, Jin-Chang [1 ]
Han, E-Chun [1 ]
机构
[1] Teach./Res. Section of Eng. Graphics, South China Univ. of Tech., Guangzhou 510640, China
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:42 / 44
相关论文
共 50 条
  • [41] COMPUTER-AID MINE LAYOUT AND RAMP DESIGN FOR MICRO-COMPUTERS
    CAMPBELL, P
    NAGAI, H
    GIBSON, J
    NANTEL, J
    CIM BULLETIN, 1985, 78 (875): : 82 - 82
  • [42] A 2-PHASE HEURISTIC FOR THE 2-DIMENSIONAL CUTTING-STOCK PROBLEM
    CHAUNY, F
    LOULOU, R
    SADONES, S
    SOUMIS, F
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1991, 42 (01) : 39 - 47
  • [43] A Hybrid Genetic Algorithm for Optimization of Two-Dimensional Cutting-Stock Problem
    Mellouli, Ahmed
    Masmoudi, Faouzi
    Kacem, Imed
    Haddar, Mohamed
    INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2010, 1 (02) : 34 - 49
  • [44] A sequential heuristic procedure for the two-dimensional cutting-stock problem
    Suliman, SMA
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 99 (1-2) : 177 - 185
  • [45] Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm
    Varela, Ramiro
    Munoz, Cesar
    Sierra, Maria
    Gonzalez-Rodriguez, Ines
    SOFTWARE AND DATA TECHNOLOGIES, 2008, 22 : 332 - +
  • [47] The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon
    Bennell, JA
    Dowsland, KA
    Dowsland, WB
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (03) : 271 - 287
  • [48] Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
    Leao, Aline A. S.
    Furlan, Marcos M.
    Toledo, Franklina M. B.
    APPLIED MATHEMATICAL MODELLING, 2017, 48 : 250 - 268
  • [49] HEURISTIC SCHEDULING MODELS FOR VARIANTS OF 2-DIMENSIONAL CUTTING-STOCK PROBLEM
    PEGELS, CC
    TAPPI, 1967, 50 (11P1): : 532 - &
  • [50] Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
    Wu, Tao
    Akartunali, Kerem
    Jans, Raf
    Liang, Zhe
    INFORMS JOURNAL ON COMPUTING, 2017, 29 (03) : 523 - 543