Home
Editorial Committee
Brief Instruction
Back Issues
Instruction to Authors
Submission on line
Contact Us
Chinese

  The journal resolutely  resists all academic misconduct, once found, the paper will be withdrawn immediately.

Title:T square algorithm for rectangular cutting stock problem
Authors: Fang Rengcun  Cao Ju  Chen Xuesong(Huazhong University of Science & Technology)       Ma  Xuan(Wuhan  University) 
Unit:  
KeyWords: Rectangular layout  Approximate algorithm  Optimization  T square algorithm 
ClassificationCode:TG301
year,vol(issue):pagenumber:2004,29(3):24-26
Abstract:
The paper based actual unloading technological requirement of rectangular pieces, proposes a T square approximate algorithm.First divide the rectangular stock into three blocks, and then place a kind of rectangular pieces on each block. The results show that the algorithm is valid to the large\|scale rectangular layout and ensure the productivity of unloading.
Funds:
AuthorIntro:
Reference:
1 曹炬,周济,余俊矩形件排样优化的背包算法武汉:中国机械工程,1994,5(2)
2 曹炬,周济矩形件排样优化的一种近似算法计算机辅助设计与图形学学报,1995,2
3 WangPT TwoAlgorithmforConstrainedTwoDimensionalCuttingStockProblems.OperationsResearch,1983,31(3):573~586
4 YanaseeHH .Two dimensionalcuttingstockwithmultiplestocksizes.TheJournalofOperationalResearchSociety.1991,42(8):673~683
5 ChaungFA TwoPhaseHeuristicfortheTwoDimensionalCuttingStockProblems.TheJournalofOperationalResearchSociety,1991,42(1):39~47
6 ChristofidesN .Analgorithmfortwo dimensionalcuttingproblems.ofOp erationsResearch,1977,25(1):30~40
Service:
This site has not yet opened Download Service】【Add Favorite
Copyright Forging & Stamping Technology.All rights reserved
 Sponsored by: Beijing Research Institute of Mechanical and Electrical Technology; Society for Technology of Plasticity, CMES
Tel: +86-010-62920652 +86-010-82415085     Fax:+86-010-62920652
Address: No.18 Xueqing Road, Beijing 100083, P. R. China
 E-mail: fst@263.net    dyjsgg@163.com