Abstract—In the rectangle packing problem different ordered items (rectangular) compete for a stock sheet with an objective so that maximum sheet utilisation is obtained. The bill of material and stock sheet can be classified into three different categories (and so are objects) as regular when length/ width ratio is uniformly distributed (1.25±0.25) (Wood, Glass industry), standard (length/ width ratio is uniformly distributed (3±0.3) (Paper Industry) and tapered (length/ width ratio is uniformly distributed (6±1) (VLSI Circuits, Adhesive Tapes). Likewise stock sheets can be the categorised as regular, standard or tapered. Thirty rules (heuristics) have been suggested by the authors in the revised/ reworked rectanglepacking algorithm suggested by Cheok-AYC Nee so as to generate different 120 feasible patterns and to draw various statistical inferences. In this paper, synthetically normally distributed bill of material has been generated to test the hypothesis if the nature of items and sheet put up with any correlation.
Index Terms—Greedy Approach, Heuristics algorithm, industrial applications, NP-complete problems, Rectangle Packing, Sheet Layout.1
Leena Jain , Ph. D., Research Scholar, University College of Engineering, Punjabi University, Patiala 147002, India(e-mail: jain_lina@yahoo.co.in/leenajain79@gmail.com).
r. Kawaljit Singh, Director, University Computer Centre, Punjabi University, Patiala 147002, India(e-mail: singhkawaljeet@pbi.ac.in/ singhkawaljeet@rediffmail.com).
[PDF]
Cite: Kawaljeet Singh and Leena Jain, "Associating Statistical Relationship among Stock-sheet and Pieces in Rectangle Packing,"
International Journal of Engineering and Technology vol. 2, no. 6, pp. 608-615, 2010.
