An approach to two-dimensional cutting stock problems

1987-2
Dağlı, Cihan H.
Tatoğlu, Yalçın
One of the resource utilization problems is the location of two-dimensional patterns onto stock sheets with finite dimensions. Stock sheets, in this respect, are depletable resources to be used and the remaining material which is known as the scrap (or trim loss) cannot usually be used later for allocating patterns. Thus, a decrease in the amount of scrap yields a decrease in the raw material cost. In the solution of the problem, usually templates of the patterns to be cut are placed on a stock sheet and then moved until an arrangement is obtained that appears to yield a minimum amount of scrap. Presently, this type of manual solution procedure is used and the algorithms are terminated intuitively when the solution obtained is usually far from the optimum. On the other hand, mathematical programming techniques are generally inadequate for the solution of these problems due to computational burden. Hence, the use of heuristics becomes more appropriate. In this study, a heuristic approach is proposed and the associated software is developed which uses various priority rules of allocation depending on the shapes of patterns. The proposed heuristic approach is then tested through data of some metal-cutting industries and satisfactory results are obtained.
International Journal of Production Research

Suggestions

 APPLICATION OF 3 NONLINEAR-PROGRAMMING TECHNIQUES IN OPTIMIZING MACHINING CONDITIONS ESKICIOGLU, AM; ESKICIOGLU, H (SAGE Publications, 1992-01-01) Mathematical models used for determining optimal machining conditions are non-linear functions subject to non-linear constraints. In this paper models for unit production cost and unit production time for multi-pass milling operations are developed, taking cutting speed, depth of cut, feed and number of passes as design variables. The problem is then solved by three non-linear programming methods, namely the generalized reduced gradient (GRG) method, the sequential unconstrained minimization technique (SUMT...
 Dissimilarity maximization method for real-time routing of parts in random flexible manufacturing systems Saygin, C; Kilic, SE (Springer Science and Business Media LLC, 2004-04-01) This paper presents a dissimilarity maximization method (DMM) for real-time routing selection and compares it via simulation with typical priority rules commonly used in scheduling and control of flexible manufacturing systems (FMSs). DMM aims to reduce the congestion in the system by selecting a routing for each part among its alternative routings such that the overall dissimilarity among the selected routings is maximized. In order to evaluate the performance of DMM, a random FMS, where the product mix is...
 Investigation of process-affected zone in ultrasonic embossing of microchannels on thermoplastic substrates Sucularli, Ferah; Arıkan, Mehmet Ali Sahir; Yıldırım, Ender (Elsevier BV, 2020-02-01) In this paper, the process-affected zone in ultrasonically embossed thermoplastic substrates is investigated both numerically and experimentally. Commercialization of microfluidic devices challenges the need for high-speed manufacturing of plastic chips. Ultrasonic embossing is considered as an alternative method since the cycle time can be as low as a few seconds per chip while keeping the cost relatively low. To examine the ultrasonic embossing process, experiments were carried out to replicate 200 mu m w...
 Spatial synthesis by disjunctive constraint satisfaction Baykan, CA; Fox, MS (Cambridge University Press (CUP), 1997-09-01) The spatial synthesis problem addressed in this paper is the configuration of rectangles in 2D space, where the sides of the rectangles are parallel to an orthogonal coordinate system. Variables are the locations of the edges of the rectangles and their orientations. Algebraic constraints on these variables define a layout and constitute a constraint satisfaction problem. We give a new O(n(2)) algorithm for incremental path-consistency, which is applied after adding each algebraic constraint. Problem requir...
 Scheduling parallel machines to minimize weighted flowtime with family set-up times Azizoğlu, Meral (Informa UK Limited, 2003-01-01) We describe and evaluate several branch-and-bound algorithms for an identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted flowtime. The algorithms differ by choice of lower bound method. Computational results suggest conditions favourable to a particular algorithm as well as the range of problem sizes that can be optimally solved in reasonable CPU time.
Citation Formats
C. H. Dağlı and Y. Tatoğlu, “An approach to two-dimensional cutting stock problems,” International Journal of Production Research, pp. 175–190, 1987, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52174.