Concepts of neighbourhood and universal compact yield towards achieving best pattern layouts

International Journal of Production Research

Volumn 37, Issue 16, 1999, Pages 3643-3658

  Cheng, S K ^a   Rao, K P ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; INVENTORY CONTROL; PROBLEM SOLVING; PROCESS ENGINEERING; STRATEGIC PLANNING;

COMPACT NEIGHBORHOOD ALGORITHMS (CNA); CUTTING STOCKS;

PRODUCTION CONTROL;

EID: 0032596138     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499189961     Document Type: Article

References (18)

1. Adamowicz, M, 1969, The optimum two-dimensional allocation of irregular, multiple-con nected shapes with linear, logical and geometric constraints. PhD thesis, Department of Electrical Engineering, New York University, USA.
2. Cheng, S K and Rao, K P., 1995a, Automatic generation of clearance for flat patterns. Proceedings of the 7th International Manufacturing Conference in China, Vol. 2, pp. 191-197;
3. Cheng, S K and Rao, K P., 1995 b, Quick nesting of arbitrarily shaped flat patterns. Proceedings of the 3rd International Conference on Manufacturing Technology in Hong Kong, pp. 583-588;
4. Cheng, S K and Rao, K P., 1996, Quick clustering of flat patterns using branch-and-bound and freeman code tech niques. Proceedings of the 4th International Conference on Sheet Metal, Twente, The Netherlands, Vol. 1, pp. 93-104;
5. Cheng, S K and Rao, K P., 1997, Quick and precise clustering of arbitrarily shaped flat patterns based on stringy effect. Computers & Industrial Engineering-an International Journal, 33, 485-488.
6. Cheok, B. T, Foong, K Y. and Nee, A. Y. C., 1996, An intelligent planning aid for the design of progressive dies. Journal of Engineering Manufacture, 210, 25-35.
7. Dori, D. and bEn-Bassat, M, 1983, Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition Computer Vision, Graphics and Image Processing, 24, 131-159;
8. Dori, D. and bEn-Bassat, M, 1984, Efficient nesting of congruent convex figures. Image Processing and Computer Vision, 27, 228-235.
9. Gan, S. E. and Chan, C. K, 1996, Pattern Drafting, Cutting and Sewing for Light Clothing (Hong Kong: Academic & Professional).
10. Gilmore, P. C. and Gomory, R. E., 1961, A linear programming approach to the cutting stock problem-Part 1. Operations Research, 9, 724-746.
11. Jain, P., Fenyes, P. and Richter, T, 1992, Optimal blank nesting using simulated annealing Transactions of the ASME: Journal of Mechanical Design, 114, 160-165.
12. Jakobs, S., 1996, On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88, 165-181.
13. Koroupi, F, 1989, A heuristic-based approach to press tool design and assembly. PhD thesis, Faculty of Engineering, University of Birmingham, UK
14. Koroupi, F. and Loftus, M, 1991, Accommodating diverse shapes within hexagonal pavers. International Journal of Production Research, 29, 1507-1519.
15. Lutfiyya, H and McMillin, B, 1992, Composite stock cutting through simulated anneal ing. Mathematical and Computer Modelling, 16, 57-74.
16. Nee, A. Y. C., 1984, A heuristic algorithm for optimum layout of metal stamping blanks. Annals of the CIRP, 33, 317-320.
17. Prasad, Y. K D. V., 1994, A set of heuristic for optimal nesting of two-dimensional irregu larly shaped sheet-metal blanks. Computer in Industry, 24, 55-70.
18. Prasad, Y. K D. V., Somasundaram, S. and Rao, K. P, 1995, A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks. International Journal of Production Research, 33, 1505-1520.